A. Step size should be other than sqrt(n)
B. Cannot be improved
C. Begin from the kth item, where k is the step size
D. Start searching from the end
Answer: Option C
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