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
- 44318 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 do you mean by external sorting?
Is arraylist a class?
Is a list an array?
Is bucket sort stable?
What is the difference between ienumerable and list?
How do you reference all the elements in a one-dimension array?
What is the space complexity of selection sort?
How do you make a bubble chart with 3 variables?
How to find 3rd element from end in a linked list in one pass?
Explain what are the methods available in storing sequential files ?
Why is quicksort not stable?
What is a map programming?
What are the properties of an algorithm?
Is arraylist heterogeneous?
Define linear data structures?
