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
- 47428 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
When new data are to be inserted into a data structure?
Are collections thread safe?
Tell me about circular linked list?
What are the drawbacks of array implementation of queue?
Tell me what is quick sort?
Why do we Use a Multidimensional Array?
What are the objectives of studying data structures?
do records fall under linear or non linear data structures?
How do treesets work internally?
What is a treemap chart?
What is the complexity of bubble sort?
Define a stack?
How do you find the height of a binary tree?
Differentiate stack from array?
Which sorting algorithm is used in collections sort?
