Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 47352 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
What is sort function?
Define union-by-weight?
What are the types of map?
Can hashmap store null values?
What are different methods of collision resolution in hashing.
What is data structure and why we need it?
What is storage structure in data structure?
What is the minimization factor and time complexity of b-tree?
Which is better merge sort or quick sort?
Which interfaces are implemented by linkedlist?
Why we need cursor implementation of linked lists?
Define 2-3-4 tree?
What is link list in data structure?
What are the types of sorting?
In Data Structure, write output of given program.
