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
- 47425 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
Write an algorithm to show the reverse of link list?
Explain about the different lists available in the collection?
What is the difference between arrays sort and collections sort?
What is bubble sort algorithm?
What is height balanced tree?
What do you mean by secondary clustering?
Name few classes that implement collection interface?
Can arraylist have null values?
What is an example of an array?
Which programming language is best for data structures?
Explain what is linear search?
What are the advantages of linked list over an array?
What is the slowest sorting algorithm?
How memory is reserved using a declaration statement in data structure?
Define depth and height of a tree?
