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
- 44511 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 would you sort words in a large file?
How to reference all the elements in a one-dimension array?
What is data type with example?
What are threaded binary trees?
Where will be the free node available while inserting a new node in a linked list?
Differentiate between set and map.
What is best time complexity?
What is difference between list and array list?
What do you mean by level of the tree?
What is hashing with example?
Advanced problems related to Data Structures were asked
Is quicksort faster than merge sort?
What is the use of sorting?
What is data structure and data type?
What are the advantages of binary search over linear search?
