Chapter 14, Problem 8PP

Program Plan Intro

To implement radix sort algorithm to sort arbitrary “int” values

Program plan:

• In the file “ArrayUtil.java”, import necessary package, and create a class “ArrayUtil”,
  • Create “Random” object.
  • Define the method “randomIntArray()”to create an array filled with random values.
  • Define the method “swap()” to swap two entries of an array.
• In the file “StopWatch.java”, create a class “StopWatch”,
  • Declare private variable.
  • Define the constructor to construct a stopwatch that is in the stopped state and has no time accumulated.
  • Define the method “start()” to start the stopwatch, and time starts accumulating now.
  • Define the method “stop()” to stop the stopwatch, and time stops accumulating and is added to the elapsed time.
  • Define the method “getElapsedTime()” to return the total elapsed time.
  • Define the method “reset()” to stop the watch and resets the elapsed time to 0.
• In the file “Radix.java”, create a class “Radix” that performs a radix sort on an array of integer values,
  • Define the method “sort()” to sort the array using radix sort.
• In the file “RadixSortTimer.java”, import the package, and create a class “RadixSortTimer”,
  • Define the method “main()”,
    • Initialize the necessary variables.
    • Create random array.
    • Create an object for “StopWatch”.
    • Call the method “start()” to start the timer.
    • Call the method “sort()” to sort the array.
    • Call the method “stop()” to stop.
    • Check if the array is sorted, using the function “checkSorted()”,
    • If it is true, print the elapsed time.
      • Otherwise, print the error.
      • Define the method “checkSorted()” to check whether the array is sorted.