How do you do binary search?
- 1 Answers
- 976 Views
- I also Faced
- E-Mail Answers
Answer / Vinay Sagar
Binary search is a divide-and-conquer algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half. The process continues until the target value is found or the interval containing it becomes empty.
| Is This Answer Correct ? | 0 Yes | 0 No |
Define the tree data structure.
What are the topics in data structures?
Which list does not allow duplicates?
What is hashing technique? Describe in brief.
What is the need for priority queue?
When will you sort an array of pointers to list elements, rather than sorting the elements themselves?
Explain Array of pointers?
Define forest?
How do arrays work?
How many times is merge sort called?
Is arraylist a class?
What is a data structure definition?
Windows 
