Chapter 23, Problem 23.7PE

Program Plan Intro

Min-heap

Program Plan:

Filename: Sorting.java

• Import the required packages.
• Create a class “Sorting”:
  • Define the main method
    • Generate the heap and initialize the heap elements.
    • Validate the size and the remove the elements from the heap.

Filename: MinHeap.java

• Define the class “minHeap”
  • Create a new array list.
  • Create a method “MinHeap()”.
    • Define a method “MinHeap()”.
      • Loop that iterates to add all the elements into the heap.
    • Define a method “add()”
      • Add the objects into the list.
      • Assign the current index value.
      • Loop that validates the index value is greater than zero.
      • Based on the requirements and condition defined swap is made on the list.
      • Finally elements are added into the list
    • Define the method “remove()”
      • Validates the size of list.
      • Initialize the remove object.
      • Loop that iterates to validate the index value is greater the size of the list.
      • Based on the requirements and condition defined swap is made on the list.
      • Finally the required element is removed from the list.
    • Define the method “getsize()”
      • Used to return the size of the list.