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 |
Define biconnectivity?
Should I use hashmap or hashtable?
What does abstract data type means?
23 Answers College School Exams Tests, Infosys, SBIT, TCS,
Who invented merge sort?
Define heap order property?
Is a hashmap a dictionary?
Write the importance of hashing?
What is time complexity of sorting algorithms?
Is array of data structure?
What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?
Explain Array
What is subtree?