How efficient is binary search?
- 1 Answers
- 946 Views
- I also Faced
- E-Mail Answers
Answer / Sweety Kumari
Binary Search is an extremely efficient search algorithm when the data is sorted. It has a time complexity of O(log n) in the average and worst cases, where n is the number of elements in the array. However, it requires the input array to be sorted beforehand.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is array traversing?
What are the basic operations of stack?
Why are b trees used?
List the data structures which are used in rdbms.
What is numeric array?
Define an algorithm. What are the types of algorithms?
Define graph?
What are the disadvantages of using collection classes over arrays?
Difference between hashset and treeset?
Define distributed query and linked server?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
Define a priority queue?
Windows 
