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
- 45960 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
Can an arraylist be null?
Define shortest path?
What is an externalizable interface?
What is a minimum spanning tree?
How do we find duplicate elements in an array?
Is array a collection?
how to display Singly Linked List from First to Last?
Explain the types of linked lists.
What package is arraylist?
Which data structure is applied when dealing with a recursive function?
Why is it important to sort waste?
What is data structure operations?
How does the size of arraylist increases dynamically?
Is list a data type?
What is nsmutablearray?
