Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
Answer Posted / spandana
Binary search is faster
| Is This Answer Correct ? | 10 Yes | 3 No |
Post New Answer View All Answers
What are the types of binary tree?
How do I sort a hashmap key?
Explain the sorting algorithm that is most suitable to be used with single linked list?
Differentiate between hashmap and treemap.
Why is data structure?
What is a treemap used for?
Can treemap key null?
Should I use hashmap or hashtable?
Define degree of the node?
Define static data structures?
Explain what are the methods available in storing sequential files ?
Why is quicksort faster than merge sort?
Is vector a collection?
What is the time complexity of hashmap get () and put () method?
Difference between hashset and treeset?