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
- 46550 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 is nonlinear data?
What is advantage and disadvantage of linked list?
What is bubble sort with example?
List some applications of tree-data structure?
Which is better merge or quick sort?
Give a basic algorithm for searching a binary search tree?
Define parent node?
What is a list in data structure?
Define the term “percolate down”?
List the data structures which are used in hierarchical data model.
Describe the height term in a tree.
What is insertion sort technique?
What is a undirected graph?
What are the advantage of linked list over array?
What is an recursive algorithm?
