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
- 46199 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 should be done in the base case for this recursive problem?
Why might quick sort might be better than merge sort?
What is difference between set and map?
What is mergesort and hashtable?
What does bubble sort do?
Are linked lists considered linear or non-linear data structures?
What is hashing in cyber security?
where do you use double linked list?
What is entryset method in map?
Which is more efficient merge sort vs quicksort?
Explain recursive function & what is the data structures used to perform recursion?
What exactly is data?
What is data structure and why we need it?
Why linked lists are better than arrays?
Does linked list allow null values?
