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
- 42995 Views
- Syntel, TCS, I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Differentiate among cycle, path, and circuit?
Explain the term tail recursion?
What is array in data structure with example?
Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
What is ds tree?
Can I provide array size dynamically?
Parenthesis is never required in postfix or prefix expressions, why?
How to reverse a singly linked list?
What is data structure explain in detail?
What is an externalizable interface?
What are the basic data structures?
Is treeset synchronized?
Can you make an arraylist of arrays?
Can arraylist be empty?
