MCQ Bank

The best-case time complexity of binary search occurs when the target is:

Interpolation search can outperform binary search when the data is sorted and:

Linear search has a worst-case time complexity of:

Binary search requires the input array to be:

Binary search on a sorted array of n elements runs in what worst-case time?