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
- 46174 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / akbar
binary search is faster than linear search.
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
What is circular queue example?
Explain the term binding time?
Give one example of right rotation.
What is comparable interface?
How many types of data structure are there?
What is the best time complexity of bubble sort?
What is difference between hashmap and hashtable?
Where is binary tree used?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
How does a selection sort work?
What is the most used data structure?
How do you assign an address to an element of a pointer array ?
Do you know how to find if linked list has loop?
Define a right-skewed binary tree?
Can the double-checked locking fail on a single processor system?
