Sorting algorithms/Heapsort: Difference between revisions
Content added Content deleted
m (→version 1: changed the wording in the REXX (version1) section header.) |
m (→version 1: corrected a scripting tag.) |
||
| Line 2,864: | Line 2,864: | ||
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
/*──────────────────────────────────────────────────────────────────────────────────────*/ |
||
show: do e=1 for #; say ' element' right(e,length(#)) arg(1) @.e; end; return</lang> |
show: do e=1 for #; say ' element' right(e,length(#)) arg(1) @.e; end; return</lang> |
||
''output''' using the (default) Greek alphabet for input: |
'''output''' using the (default) Greek alphabet for input: |
||
<pre> |
<pre> |
||
element 1 before sort: alpha |
element 1 before sort: alpha |
||