Heap Sort - Sorting Algorithm Animations

Animation, code, analysis, and discussion of heap sort on 4 initial conditions. ... # heapify for i = n/2:1, sink(a,i,n) → invariant: a[1,n] in heap order # sortdown for i = 1:n, swap a[1,n-i+1] sink(a,1,n-i) → invariant: a[n-i+1,n] in final position end

www.sorting-algorithms.com