Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

Answers were Sorted based on User's Feedback



Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / suchita

binary search

Is This Answer Correct ?    36 Yes 1 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

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

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

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

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

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

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / suresh

obviously binary search

Is This Answer Correct ?    10 Yes 1 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / spandana

Binary search is faster

Is This Answer Correct ?    10 Yes 3 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

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

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

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 one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / mahes

binarysearch is paster then sequentiolsearch

Is This Answer Correct ?    7 Yes 1 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / bharathi

Binary search

Is This Answer Correct ?    5 Yes 0 No

Post New Answer

More Data Structures Interview Questions

What are the non linear data structure?

0 Answers  


Can a class have a constructor?

0 Answers  


What are the Advantages and disadvantages of Array?

0 Answers  


What thread means?

0 Answers  


Which sorting algorithm has minimum number of swaps?

0 Answers  






What is data structure geeksforgeeks?

0 Answers  


What is binary tree give example?

0 Answers  


What is a weighted graph?

0 Answers  


How would you sort a linked list?

5 Answers  


Define non-linear data structures?

0 Answers  


What are data members?

0 Answers  


Write a program for Sorting an Array. Which sorting will you prefer?

0 Answers  


Categories