Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
→{{header|TI-83 BASIC}}
Line 900:
=={{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), but I coded this when I was paying attention to a math lecture. Could you make a better version that accepts any input, without having to use my clunky <code>If</code> structure?
:If dim(L<sub>1</sub>)>7
:Then
| |||