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
- 46009 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / binita
binary search is faster
as the root has the value greater then left subtree & less
then right subtree so sorting is easier
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How do I use quick sort?
How do you implement a stack?
What is difference between array and arraylist?
What is stack in data structure with the example?
Why is sorting necessary?
What does arrays tostring do?
What is the difference between array and stack in data structures?
What is dynamic array how it is created?
What do you mean by structure property in a heap?
Why do we need linked list?
Which sorting is best?
Which is better merge sort or quick sort?
Does linkedhashset allow null values?
Is set sorted?
What are priority queues?
