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 a vector class?
What are the types of collision resolution strategies in open addressing?
Is a list an array?
Why quicksort is faster than merge sort?
Which sorting algorithm is best for large data?
You want to insert a new item in a binary search tree. How would you do it?
There are 2 int type array data type. One is containing 50 elements, and another one is containing 30 elements. Can we assign the array of 50 elements to an array of 30 elements?
Difference between calloc and malloc ?
Write the algorithm for converting infix expression to postfix expression?
Tell me do array subscripts always start with zero?
Is data structures and algorithms important?
What is binary search tree and explain its time complexity?