Sorting algorithms/Heapsort: Difference between revisions

m
Line 1,995:
=={{header|Julia}}==
<lang julia>function pd!(a, first, last)
rwhile (c = 2 * first - 1) < last
while (c = 2 * r - 1) < last
if c < last && a[c] < a[c + 1]
c += 1
end
if a[rfirst] < a[c]
a[c], a[rfirst] = a[rfirst], a[c]
rfirst = c
else
break
4,108

edits