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
- 47429 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / angu
Binary Search is efficent and faster because in Binary
search we search in systematic way which helps to fetch the
data easy. where as in Sequential search we have to come
across tll the nodes to get the desired data.
| Is This Answer Correct ? | 5 Yes | 4 No |
Post New Answer View All Answers
What are priority queues?
Describe stack operation.
What is an example of an array?
Why do we need linked list?
How does quicksort partition work?
Which is faster hashmap or concurrenthashmap?
What is array define its types?
Is hashmap part of collection?
Define a binary tree?
What is a simple path?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
what is the difference between Linear Array and Linked List?
Is array immutable?
List all data structures you would use for a memory management module.
Is complete binary tree?
