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 / suresh
obviously binary search
| Is This Answer Correct ? | 10 Yes | 1 No |
Post New Answer View All Answers
Define a linear data structure.
Tell me about circular linked list?
How does the bubble sort work?
Define quadratic probing?
What are sorting algorithms used for?
How many pointers are necessary to implement a simple linked list?
What is ds tree?
Define a tree?
What are the disadvantages of linear list?
How does a binary search work?
Will this code give error if I try to add two heterogeneous elements in the arraylist? And why?
Can we remove element from arraylist while iterating?
Why it is important to have aligned addresses? What is the exception generated when there is a misaligned address?
Why linked list is required?
Is hashmap get thread safe?