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
- 42996 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 declaring array?
What is perfect binary tree?
Explain how is linked list implemented?
How do you declare An array of three pointers to chars
Explain linear linked implementation of Stack and Queue?
What is a binary search tree? Explain with example?
Is hashmap get thread safe?
Can you use Bubble Sort To sort the number of elements.
Does stringutils isempty check for null?
How many null values are allowed in a set?
Why do we study data structures?
What is a data structure node class?
Define linked list data structure.
Why you need a data structure?
When will we get ArrayStoreException?
