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
- 41728 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / ahan
The binary search is faster than the sequential search.The
complexity of binary search is 'log n' where as the
complexity of sequential search is 'n'.Since each time we
are proceeding we have to deal with only half of the
elements of the array than the previous one.So we can easily
get a number from an array of elements through binary search
than sequential search.
| Is This Answer Correct ? | 12 Yes | 0 No |
Post New Answer View All Answers
What is quick sort example?
How would you reverse the characters of an array?
Is bucket sort a comparison sort?
How many types of lists are there?
How do you declare An array of three char pointers
What is bubble sort used for?
Define linked list data structure.
Write the c program to insert a node in circular singly list at the beginning.
How many types of linked list are there?
What is a queue in data structure?
Name few collections map implementations?
What is time complexity of hashmap?
Can arraylist hold different types?
What is the purpose of thread?
What is peep stack?
