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
Answer / guest
A Binary search of an ordered set of elemaents in an array
| Is This Answer Correct ? | 2 Yes | 0 No |
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 |
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 |
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 |
Answer / uma sankar reddy.p
Binarysearch is faster than sequential search
| Is This Answer Correct ? | 0 Yes | 0 No |
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 |
What is the main advantage of a linked list?
How to get a list of tables, views and columns in firebird database?
Why do we use dynamic arrays?
Mention some drawbacks of the linked list.
Which is the parent class of linkedlist class?
Explain Queue
What is application of data structure?
What is binary search in programming?
What does adt stands for?
How dynamic arrays are created?
Is boolean a data type?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.