Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.
Answer Posted / naresh
binary search..if the elements are not in a sorted order
then sequential search or linear search would be better.
| Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
Tell me why might quick sort might be better than merge sort?
What is heap tree explain with example?
Which interfaces are implemented by enumset?
What are the basic data structures?
What are the advantages of linked list over an array?
Differentiate null and void?
Define shortest path?
State the properties of a binary tree?
What is raid (redundant array of inexpensive disks)?
What are the applications of priority queues?
What is the difference between dictionary and hashtable?
What is data structure and its types?
What are the major data structures used in the hierarchical data model?
What is binary search in data structure?
What are common data structures?