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
- 47342 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
Which sort is best for linked list?
What are the tasks performed during preorder traversal?
Can sets contain duplicates?
Differentiate between arraylist and linkedlist.
Explain recursive function & what is the data structures used to perform recursion?
What is worst case complexity algorithm?
Write the importance of hashing?
Write the postfix form of the expression: (a + b) * (c - d)
Are sets sorted?
Explain binary search tree?
What is bubble sort and quick sort?
Can we put null key in hashmap?
How does arraylist size work?
what is Linked lists?
What is difference between list set and map?
