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 / akbar

binary search is faster than linear search.

Is This Answer Correct ?    3 Yes 0 No

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

Answer / guest

A Binary search of an ordered set of elemaents in an array

Is This Answer Correct ?    2 Yes 0 No

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

Answer / ibna

binary search

Is This Answer Correct ?    2 Yes 0 No

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

Answer / angu

Binary Search is efficent and faster because in Binary
search we search in systematic way which helps to fetch the
data easy. where as in Sequential search we have to come
across tll the nodes to get the desired data.

Is This Answer Correct ?    5 Yes 4 No

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

Answer / siya

binary search...............

Is This Answer Correct ?    0 Yes 0 No

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

Answer / binita

binary search is faster
as the root has the value greater then left subtree & less
then right subtree so sorting is easier

Is This Answer Correct ?    0 Yes 0 No

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

Answer / rohini c

Binnary search tree complexity is log n where as linear search terr complexity is 'n'so it is quite clear from complexity that Binnary tree is faster than sequential search or linear search........complexity means rate of execution time.

Is This Answer Correct ?    0 Yes 0 No

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

Answer / uma sankar reddy.p

Binarysearch is faster than sequential search

Is This Answer Correct ?    0 Yes 0 No

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

Answer / p.divya poojitha

binary search is faster than sequential searching.in
sequential searching the desired record is 4000 if u search
that record can be done with 1....4000 so it takes large
time for searching compare complexities of both searching
meathods are
binary search O(logn)
sequential search O(n)

Is This Answer Correct ?    0 Yes 0 No

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

Answer / priyank

Binary search tree..:)

Is This Answer Correct ?    0 Yes 1 No

Post New Answer

More Data Structures Interview Questions

State the demerit of linear representation of binary trees?

0 Answers  


What happens if an array goes out-of-bounds?

0 Answers   TCS,


In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none

1 Answers  


Is array of data structure?

0 Answers  


List the applications of stacks?

0 Answers  


What is heap with example?

0 Answers  


Explain different methods in which you can traverse a tree?

0 Answers   NIIT,


List the abstract operations in the set?

0 Answers  


What exactly is a thread?

0 Answers  


What is difference between list and array list?

0 Answers  


What is a Breadth First Search? Give a few of its applications.

0 Answers   Ciena,


What is structured data with example?

0 Answers  


Categories