Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
m
→{{header|TI-83 BASIC}}: off topic
m (→{{header|FreeBASIC}}: removed redundant code) |
m (→{{header|TI-83 BASIC}}: off topic) |
||
Line 3,709:
=={{header|TI-83 BASIC}}==
Store list with a dimension of 7 or less into L<sub>1</sub> (if less input will be padded with zeros), run prgmSORTHEAP, look into L<sub>2</sub> for the sorted version of L<sub>1</sub>. It is possible to do this without L<sub>3</sub> (thus, in place)
:If dim(L<sub>1</sub>)>7
:Then
| |||