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 / amit patra
A sequential search of the elements.
| Is This Answer Correct ? | 0 Yes | 2 No |
Post New Answer View All Answers
What is collision in data structure?
Which method will arrange the element of an array in alphabetical order?
What is a 2 dimensional array?
What does a treemap do?
Why do we need sorting algorithms?
What is subtree?
What is the relationship between a queue and its underlying array?
What does simulation of queues mean?
Can I provide array size dynamically?
What are the applications of b-tree?
Name few collections map implementations?
What is an example of an algorithm?
What is the difference between a push and a pop?
What is linked hash set?
Different Types of pattern?