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
- 41752 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / suchita
binary search
| Is This Answer Correct ? | 36 Yes | 1 No |
Post New Answer View All Answers
Why is quicksort better than mergesort?
State the difference between stacks and linked lists?
We know that Arrays are objects so why cannot we write strArray.length()?
What is frozenset?
What are stacks? Give some of its applications.
What does list clear do?
Write is a binary search tree? Write an algorithm and tell complexity?
What is the need for extendible hashing?
What do you mean by 2-3 tree?
What is treemap chart?
How do you use merge sort?
Define structure property in a heap?
Can you change size of array once created?
Differentiate between hashmap and hashtable.
Is quicksort divide and conquer?
