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
- 46599 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
Explain the Stack
What are threaded binary trees?
What is binary tree? Explain its uses.
What is example of data?
How does hashset maintain order?
What is the Difference between treemap and hashmap?
what is traversal in linked lists?
What are the advantages of data structure?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
What does the term sorting refer to?
Can we add heterogeneous elements into treemap?
How do you get placements?
What are different dynamic memory allocation technique in c.
What is a subtree?
Define a binary tree?
