Counting sort runs in linear time when the range of input values k is:

Radix sort sorts numbers by processing:

Which of the following sorting algorithms is NOT comparison-based?

Any comparison-based sorting algorithm has a lower bound on worst-case comparisons of:

Heapsort achieves its ordering by first building a heap and then repeatedly:

Shell sort improves on insertion sort by:

Bucket sort achieves linear average-case time by: