Chapter 14, Problem 14PE

Program Plan Intro

Merge sort

Program plan:

Main.java

• Create a class named “Main”. Inside the class,
  • Define the “main ()” method.
    • Declare the array
    • Loop that iterates to generate value
    • Define the object for the class
    • Call the method “sort()”.
    • Print the resultant value.

MergeSorter.java:

• Create a class named “MergeSorter”. Inside the class,
• Define the required variables
• Define the constructor and initialize the variables
  • Define the method “sort()”
    • Declare the required variables
    • Loop that iterates for the length of the array
    • Loop that iterates to perform the merge operation
    • Assign the size value.
  • Define the method “merge()”
    • Merge both half value into a temporary vector
    • Loop that iterates to move the elements into the exact position.
      • Use necessary conditions to compare the values
      • Assign the values at exact position
      • Increment the value
        • Loop that iterates to move the elements into the exact position in the first half
        • • Use necessary conditions to compare the values
          • Assign the values at exact position
          • Increment the value
        • Loop that iterates to move the elements into the exact position in the second half
        • • Use necessary conditions to compare the values
          • Assign the values at exact position
          • Increment the value
        • Again the elements are copied back from the temporary vector.