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
- 44151 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
What data structure does a binary tree degenerate?
Which interfaces are implemented by linkedlist?
What is the use of isEmpty() member methods?
How do arrays work?
What is a vector element?
How do you increase the capacity of an arraylist?
How do you initialize an arraylist?
Why do we study data structures?
What is default array size?
Define balance factor of a node in avl tree?
Which sorting algorithm is the slowest?
What is meant by a dynamic array?
How to use appendNode() in linkedlist()?
Is arraylist synchronized?
Design a datastructure to represent the movement of a knight on a chess board
