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

Binary search requires the input array to be:

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:

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

What does Big-O notation describe about an algorithm?

Which sorting algorithm repeatedly selects the smallest remaining element and places it in order?