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
- 41816 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / srikanth
binary search if of order log n where as sequential search
is of order n
binary search is faster..
| Is This Answer Correct ? | 36 Yes | 2 No |
Post New Answer View All Answers
Define linked list data structure.
Why you need a data structure?
Define graph?
What is the use of sorting the data?
What does arrays tostring do?
What is the difference between linked list and array?
How efficient is bubble sort?
What is default size of hashmap?
what is traversal in linked lists?
How is a queue works?
Why is map not a collection?
What is the difference between array sort () and array sort t >()?
State the rules to be followed during infix to postfix conversions?
What are basic algorithms?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
