Chapter 14, Problem 22RE

Explanation of Solution

Big-Oh efficiency of the algorithm:

The running time of the radix sort for sorting n numbers with d digits is $\text{O}\left(\text{n×d}\right)$.

Algorithm preferable to merge sort:

The algorithm is preferable to merge sort when the number of digits d is comparatively less than $\text{O}(<$