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
- 41727 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential s..
Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential s..
More Data Structures Interview Questions
Is list a data structure?
What do you mean by 2-3 tree?
State the properties of b tree.
What are the advantage of collection classes over arrays?
Why do we use stacks?
What is a b+ tree? Explain its uses.
What does each entry in the link list called?
What is circular linked list?
Why is quicksort unstable?
what is Singly Linked list?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
Windows 
