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
- 46767 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 queue fifo or lifo?
What does arraylist remove return?
What is difference between tree and forest?
What is a hash in programming?
What are red-black trees?
How do you sort an arraylist?
What are the major data structures used in the hierarchical data model?
Is array a data structure?
What do you mean by data and data structure?
Write a Program for Delete an element from a doubly linked list.
Can arraylist be empty?
What is the maximum size of array?
Define articulation point?
What is a subtree in data structures?
Is sorting a math skill?
