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
- 41800 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / suchita
binary search
| Is This Answer Correct ? | 36 Yes | 1 No |
Post New Answer View All Answers
What is mergesort and hashtable?
Can arraylist be empty?
Is linked list faster than array?
What are the difference between arraylist and linkedlist from the perspective of sorting?
How can we remove loops in a linked list? What are the functions of fast and slow pointers?
Can we override compareto method for enumerations?
Where is data structure used?
Why quicksort is better than merge sort?
How can I search for data in a linked list?
What are the different types of linked list?
Explain quick sort and merge sort algorithms.
Can we add duplicate keys in a hashmap?
What is difference between list and set?
What are all the classes and interfaces that are available in the collections?
Which is better bubble sort or selection sort?
