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 / mahes
binarysearch is paster then sequentiolsearch
| Is This Answer Correct ? | 7 Yes | 1 No |
Post New Answer View All Answers
What are the collision resolution methods?
Which is faster arraylist or hashmap?
Why is tuple immutable?
How do you rotate an AVL tree?
What do you mean by selection sort?
Define 2-3-4 tree?
How do you balance a tree?
What are the two traversal strategies used in traversing a graph?
How do you access the values within an array?
How do you find the index of an element in an arraylist?
Two linked lists are given, find out the sum of them without altering the linked list?
How to get the index of an array element?
Why is data structure used?
Explain about set and their types in a collection?
Explain multiply linked list in short.