What is the key difference between binary search and interpolation search?
A. Interpolation search requires a sorted array.
B. Binary search can handle unsorted arrays.
C. Interpolation search is always faster.
D. Binary search is based on divide-and-conquer, while interpolation search estimates positions.
Answer: Option D
This Question Belongs to Data Structure >> Searching Algorithms
A. Jump Search
B. Linear Search
C. Interpolation Search
D. Binary Search
What is the time complexity of binary search on a sorted array?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(log n)
What is the time complexity of binary search in a balanced binary search tree (BST)?
A. O(log n)
B. O(n)
C. O(n log n)
D. O(1)
Which searching algorithm is most efficient for large datasets that are sorted?
A. Jump Search
B. Interpolation Search
C. Linear Search
D. Binary Search
Join The Discussion