Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→{{header|Eiffel}}
Line 885:
sort_array (ar: ARRAY [INTEGER])
-- Sorts array 'ar' in ascending order.
require
not_empty: ar.count > 0
local
i, j, r, l, m, n: INTEGER
Line 901 ⟶ 903:
if l > 1 then
l := l - 1
m := ar
else
m := ar
ar
r := r - 1
if r = 1 then
ar
sorted := True
end
Line 918 ⟶ 920:
j > r
loop
if (j < r) and (ar
j := j + 1
end
if m < ar
ar
i := j
j := j + i
Line 929 ⟶ 931:
end
end
ar
end
end
ensure
sorted: is_sorted(ar)
end
| |||