Question: Download to the Heap Sort Example: https://drive.google.com/open?id=1ORTOaDbGl8Nc7qlZ4l2a5AUWB0hjXCYJ Download the ZIP archive file named Heap Sort Example. Extract the folder and then open it in NetBeans.
Download to the Heap Sort Example: https://drive.google.com/open?id=1ORTOaDbGl8Nc7qlZ4l2a5AUWB0hjXCYJ
Download the ZIP archive file named "Heap Sort Example". Extract the folder and then open it in NetBeans. The heap managed in the class Heap is a maxheap. Rewrite the Heap class to manage a miniheap instead. Rewrite method heapSort in class HeapSort to make use of the return from a miniheap to sort in ascending order.
Maxheap - a maxheap is a heap in which each node is greater than or equal to any of its children.
Miniheap - a miniheap is a heap in which each node is less than or equal to any of its children. (Miniheaps are often used to implement priority queues.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
