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
- 41723 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
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 |
Which sorting algorithm is used in arrays sort?
When should structures be passed by values or by reference?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
How do you determine if a binary tree is height balanced?
what is the difference between dynamic as well as non - dynamic data structures.
Can we change the size of an array at run time?
How to sort an Array?
What does isempty() member method determines?
What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
Which is better hashset or treeset?
Is list same as array?
What does a treemap do?
Windows 
