What are the advantages of binary search over linear search?
- 1 Answers
- 1111 Views
- I also Faced
- E-Mail Answers
Answer / Pushpendra Katiyar
Binary search is more efficient than linear search, especially for large data sets. The main advantage of binary search is that it operates by repeatedly dividing the search interval in half, reducing the number of comparisons required to find an element. This results in a time complexity of O(log n) in the average case, while linear search has a time complexity of O(n).
| Is This Answer Correct ? | 0 Yes | 0 No |
Do all declaration statements result in a fixed reservation in memory?
what is the need of data structure
Is it possible to make an array volatile in java?
What is a graph?
How do you declare An array of three pointers to chars
Define distributed query and linked server?
What is impact of signed numbers on the memory using data structures?
Is char array null terminated?
How to reverse singly link list?
What are the difference between arraylist and linkedlist from the perspective of sorting?
What is the Role of push() and pop() method?
What is difference between list and array?
Windows 
