Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
- 22 Answers
- 42997 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / uma sankar reddy.p
Binarysearch is faster than sequential search
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
When is a binary search algorithm best applied?
Describe binary tree and its property.
Can a hashmap have duplicate keys?
What are the operations that can be performed on a stack?
Why is merge sort faster?
Can you make an arraylist of arrays?
What is complexity of bubble sort?
What does args stand for?
Is binary tree a bst?
What is bubble sort and quick sort?
What is circular queue example?
How helpful is abstract data type of data structures?
Does arraylist have index?
What is a class user?
Why is the isempty() member method called?
