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
- 46127 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / nishant singh
Binary search is faster because we traverse the elements by
using the policy of Divide and Conquer.
we compare the key element with the approximately center
element, if it is smaller than it search is applied in the
smaller elements only otherwise the search is applied in the
larger set of elements.
its complexity is as we all know is log n as compared to the
sequential one whose complexity is n.
| Is This Answer Correct ? | 30 Yes | 1 No |
Answer / 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 |
Answer / naresh
binary search..if the elements are not in a sorted order
then sequential search or linear search would be better.
| Is This Answer Correct ? | 7 Yes | 0 No |
Answer / ujjwal dave
binary search is faster and more useful in case we need to
perform search a number of times, complexity of sequential
search will be n each time where in binary search will take
more time only at first time when data is not sorted once
the data is sorted......it will take only only log n
attempts to search each element.......so the decision also
depends on frequency of the data beign searched
| Is This Answer Correct ? | 6 Yes | 0 No |
Which language is best to learn data structures?
Which interfaces are implemented by hashmap?
why do tree always takes o(log n) time?
how to delete first node from singly linked list?
Can we define the size of arraylist?
Describe binary tree and its property.
Differentiate null and void?
What is a Stack? Explain with example?
What is the application of queue?
What is hashing technique?
What is a cycle or a circuit?
Can list contain null values?
Windows 
