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

Binary search requires the input array to be:

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

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

Which algorithm finds shortest paths from a single source in a graph with non-negative edge weights?

Radix sort sorts numbers by processing:

An NP-complete problem is one that is: