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
- 46004 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 heap tree in data structure?
Explain what is linear search?
Can we override compareto method for enumerations?
What is a threaded binary tree? Explain its operation with example?
Why is quicksort unstable?
Define primary clustering?
What's the difference between a hashtable and a hashmap?
What is a undirected graph?
Define structure property in a heap?
What is time complexity of bubble sort?
Does hashset allow duplicates?
What is the idea behind splaying?
State the rules to be followed during infix to prefix conversions?
Are lists mutable?
What differences exist between hashmap and hashtable?
