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
Write an algorithm to show the reverse of link list?
What will happen if an array goes out of bounds?
Why is reflection slower?
What are lists?
What is treemap chart?
Write a Program for Reverse a linked list.
How null key is handled in hashmap?
What is the best case complexity of bubble sort?
how to add an item to the beginning of the list?
What is the difference between set and unordered_set?
How do hash tables work?
Which is the parent class of abstractqueue class?
What is binary tree in discrete mathematics?
What are linked lists good for?
What is difference between tree and forest?