Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→{{header|REXX}}: added "-1" to a CALL. -- ~~~~
Walterpachl (talk | contribs) m (→{{header|PL/I}}: typo) |
m (→{{header|REXX}}: added "-1" to a CALL. -- ~~~~) |
||
Line 2,143:
=={{header|REXX}}==
===version 1===
<lang rexx>/*REXX program sorts an array using the heapsort method. */
call gen@ /*generate the array elements. */
Line 2,156 ⟶ 2,157:
end /*j*/
do n=n by -1 to 2
_=@.1; @.1=@.n; @.n=_; call shuffle 1,n-1
end /*n*/
return
Line 2,197 ⟶ 2,198:
say 'element' right(j,widthH) arg(1)':' @.j
end /*j*/
say copies('
return</lang>
'''output'''
<pre style="height:30ex;overflow:scroll">
element 1 before sort: ---letters of the modern Greek Alphabet---
Line 2,228:
element 25 before sort: psi
element 26 before sort: omega
───────────────────────────────────────────────────────────────────────────────
element 1 after sort:
element 2 after sort: ==========================================
element 3 after sort:
element 4 after sort: beta
element 5 after sort:
element 6 after sort:
element 7 after sort:
element 8 after sort:
element 9 after sort:
element 10 after sort:
element 11 after sort:
element 12 after sort:
element 13 after sort:
element 14 after sort:
element 15 after sort:
element 16 after sort:
element 17 after sort: phi
element 18 after sort: pi
Line 2,251:
element 21 after sort: sigma
element 22 after sort: tau
element 23 after sort:
element 24 after sort: upsilon
element 25 after sort: xi
element 26 after sort: zeta
───────────────────────────────────────────────────────────────────────────────
</pre>
=== Version 2 ===
<lang rexx>/* REXX ***************************************************************
| |||