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
- 41733 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / naresh
binary search..if the elements are not in a sorted order
then sequential search or linear search would be better.
| Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
Can we search the data in a linked list?
Is a hashmap a dictionary?
Can hashset contain null?
What is the difference between 1d and 2d array?
What is top in stack?
Can tuple be sorted?
Write the importance of hashing?
What are the types of collision resolution strategies in open addressing?
What do you mean by Syntax Error
Define the tree data structure.
Can treemap have null values?
What is stable sort example?
What is tree and its properties?
List out the applications of a linked list?
Is binary tree a binary search tree?
