Write a program that animates the radix-sort algorithm. Create an array that consists of 20 random numbers from 0 to 1,000. The array elements are displayed, as shown in Figure 23.21. Clicking the Step button causes the program to place a number in a bucket. The number that has just been placed is displayed in red. Once all the numbers are placed in the buckets, clicking the Step button collects all the numbers from the buckets and moves them back to the array. When the
algorithm is finished, clicking the Step button displays a message to inform the user. Clicking the Reset button creates a new random array for a new start.

Transcribed Image Text:

Exercise23_17: Radix Sort 147 109 390 735 519 603 764 25 524 18 471 198 74 497 939 606 788 206 328 985 390 471 603 764 735 147 18 109 524 25 198 519 bucket[0]bucket[1]bucket(2]bucket(3]bucket[4]bucket[5]bucket[6]bucket(7]bucket[8]bucket[9)] Step Reset