In which of the following case jump search performs better than interpolation search?
A. When array has uniformly distributed values but is not sorted
B. when array is sorted and has uniform distribution of values
C. when array is sorted but the values increases exponentially
D. when array is not sorted
Answer: Option C
This Question Belongs to Data Structure >> Searching Algorithms
Related Questions on 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