0 0 votes HEAPSORT(A) 1 BUILD-MAX-HEAP(A) 2 for i = A.length down to 2 3 exchange A[1] with A[i] 4 A.heapsize=A.heapsize – 1 5 MAX-HEAPIFY(A,1) illustrate the operation of HEAPSORT on the array $A=\langle 5,13,2,25,7,17,20,8,4 \rangle$ Algorithms cormen algorithms binary-heap heap-sort descriptive + – akash.dinkar12 524 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
