Sorting algorithms/Heapsort: Difference between revisions
→{{header|Julia}}
Line 1,994:
=={{header|Julia}}==
<lang julia>function
r = first
while (c = 2 * r - 1) < last
Line 2,009:
end
hfy!(a, n) = (f = div(n, 2); while f >= 1 pd!(a, f, n); f -= 1 end)
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")
| |||