Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 46828 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
What is difference between rb tree and avl tree?
What are doubly linked lists?
What member function places a new node at the end of the linked list?
Define Data Structures?
What is data structure and why we need it?
What is difference between array and arraylist? When will you use array over arraylist?
How do you get placements?
Which one is the simplest sorting in data structure?
Are duplicates allowed in list?
How does a treemap sort?
What is heap with example?
Is data structures and algorithms important?
State the different ways of representing expressions?
What are the five examples of data?
What is insertion sort technique?
