Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→{{header|REXX}}: added two examples of sorting a mix of numbers and words to show the difference between sorting on ASCII and EBCDIC systems.
(→{{header|REXX}}: rewrote version 1, elided version 2, renumbered version 3 to version 2.) |
m (→{{header|REXX}}: added two examples of sorting a mix of numbers and words to show the difference between sorting on ASCII and EBCDIC systems.) |
||
Line 3,908:
element 10 after sort: 789
element 11 after sort: 1e5
</pre>
On an '''ASCII''' system, numbers are sorted ''before'' letters.
{{out|output|text= when executing on an '''ASCII''' system using the following for input: <tt> 11 33 22 scotoma pareidolia </tt>}}
<pre>
element 1 before sort: 11
element 2 before sort: 33
element 3 before sort: 22
element 4 before sort: scotoma
element 5 before sort: pareidolia
▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒
element 1 after sort: 11
element 2 after sort: 22
element 3 after sort: 33
element 4 after sort: pareidolia
element 5 after sort: scotoma
</pre>
On an '''EBCDIC''' system, numbers are sorted ''after'' letters.
{{out|output|text= when executing on an '''EBCDIC''' system using the following for input: <tt> 11 33 22 scotoma pareidolia</tt>}}
<pre>
element 1 before sort: 11
element 2 before sort: 33
element 3 before sort: 22
element 4 before sort: scotoma
element 5 before sort: pareidolia
▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒
element 1 after sort: pareidolia
element 2 after sort: scotoma
element 3 after sort: 11
element 4 after sort: 22
element 5 after sort: 33
</pre>
| |||