Chapter 14, Problem 15PE

Program Plan Intro

To measure the performance of the insertion sort and binary search algorithm

Program plan:

• In the file “InsertionSorter.java”, import the package, and create a class “InsertionSorter”,
  • Declare an array.
  • Define the constructor.
  • Define the method “sort()” to sort the array managed by the insertion sorter.
  • Define the method “search()” to perform binary search.
• 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 “InsertionSorterTimer.java”, import the packages, and create a class “InsertionSorterTimer”,
  • Define the “main()”  method,
    • Create an object for “Scanner”.
    • Read the array from the file.
    • Read input file.
    • Execute loop till there is a record.
    • Declare the array.
    • Create an object for “InsertionSorter”.
    • 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.
    • Print the elapsed time.
    • Create new output file.
    • Create a loop,
      • Print the array elements to the output file.
    • Close the output file.