Sorting algorithms/Heapsort: Difference between revisions
m
→{{header|Julia}}
Line 2,012:
heapsort!(a) = (n = length(a); hfy!(a, n); l = n; while l > 1 a[1], a[l] = a[l], a[1]; l -= 1; pd!(a, 1, l) end; a)
a = shuffle(collect(1:12))
println("Unsorted: $a")
| |||