In lecture, we sketched the radix sort algorithm for sorting an array of n d-digit integers, with each digit in base k, in linear time (d(n + k)). The basic algorithm is as follows:

for j=1..d do sort the input stably by each elements jth least-significant digit

The sort we used in each pass through the loop was Counting Sort, but any stable sort will work (albeit perhaps with different overall complexity).

We tried this algorithm and saw that it worked on an example. Your job is to prove inductively that this algorithm works in general. The class notes suggest proving the following loop invariant: after j passes through the loop, the input is sorted according to the integers formed by each elements j least-significant digits.

a. State and prove a suitable base case for the proof. b. Now state and prove an inductive case for the proof. You may assume that the per-digit sort used in each iteration is (1) correct and (2) stable. c. Why does the invariant imply that the radix sort as a whole is correct?