Interested to Buy Any Domain ? << Click Here >> for more details...
Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
- 22 Answers
- 46643 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / nishant singh
Binary search is faster because we traverse the elements by
using the policy of Divide and Conquer.
we compare the key element with the approximately center
element, if it is smaller than it search is applied in the
smaller elements only otherwise the search is applied in the
larger set of elements.
its complexity is as we all know is log n as compared to the
sequential one whose complexity is n.
| Is This Answer Correct ? | 30 Yes | 1 No |
Post New Answer View All Answers
Why heap sort is not used?
What is advantage and disadvantage of linked list?
How does insertion sort works?
What is the Difference between sax and dom parser?
Which is better hashmap or arraylist?
Do you know how to find if linked list has loop?
Who invented merge sort?
How many types of linked list are there?
How do I remove a value from a list?
How does a selection sort work?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
How do hash tables work?
What do you understand by stable sort?
What are the topics in data structures?
What is the use of data structure?
