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
- 41798 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / ahan
The binary search is faster than the sequential search.The
complexity of binary search is 'log n' where as the
complexity of sequential search is 'n'.Since each time we
are proceeding we have to deal with only half of the
elements of the array than the previous one.So we can easily
get a number from an array of elements through binary search
than sequential search.
| Is This Answer Correct ? | 12 Yes | 0 No |
Post New Answer View All Answers
Is vector a collection?
What are the types of collection?
What is difference between array and string?
Is arraylist fail fast?
Write the postfix form of the expression: (a + b) * (c - d)
What is m way tree in data structure?
Tell me why can't constant values be used to define an array's initial size
What is comparable interface?
What is a minimum spanning tree?
What is time complexity of hashmap?
What is harvesting in agriculture?
Write a program using mergesort technique.
Can arraylist store objects?
Is null a binary search tree?
How dynamic arrays are created?
