Question: ALGORITHM Use Heap-Sort to sort the array, A=[7, 5, 4, 12, 18, 0, 5, 3, 2, 18] HeapSort(A) { Build-Max-Heap(A) for ( i = A.length
ALGORITHM
Use Heap-Sort to sort the array, A=[7, 5, 4, 12, 18, 0, 5, 3, 2, 18]
HeapSort(A)
{
Build-Max-Heap(A)
for ( i = A.length downto 2)
{
swap ( A[ 1 ] with A[ i ])
A.heapsize = A.heapsize - 1
Max-Heapify(A, 1)
}
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
