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
- 44576 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
Is unordered_map a hash table?
Which is best array or linked list?
Can treemap key null?
Explain quick sort and merge sort algorithms.
What is a undirected graph?
What do u mean by array?
Which is faster array or linked list?
What is collections singletonlist?
What are the average and worst time complexity in a sorted binary tree is
What do you mean by recursive definition?
Is merge sort better than quick?
Does mentioning the array name gives the base address in all the contexts?
What happens if an array goes out-of-bounds?
Write a program to insert an element and in the specific position in the array?
What is top in stack?
