Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
→{{header|J}}: avoiding parentheses
(→{{header|J}}: reduce to one (0,])) |
(→{{header|J}}: avoiding parentheses) |
||
Line 458:
while. e > c=.1+2*s=.c do.
if. e > 1+c do. if. c <&({&z) c+1 do. c=.c+1 end. end.
if. s <&({&z) c do. z=.
end.
z
|