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
- 46604 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / srikanth
binary search if of order log n where as sequential search
is of order n
binary search is faster..
| Is This Answer Correct ? | 36 Yes | 2 No |
Post New Answer View All Answers
Write a recursive c function to calculate the height of a binary tree.
What is scalar example?
What is the space complexity of selection sort?
In depth questions regarding the data structures and the Databases used in the Projects developed.
How many links are there in a binary tree of N nodes?
What is difference between while and do while?
Differentiate between iterator and enumeration.
Is hashmap ordered?
What is difference between arraylist and linkedlist?
What is long data type?
Define a priority queue?
What do you mean by sorting?
Why do we need searching algorithms?
Can arraylist shrink?
What is the use of tree data structure?
