Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|TI-83 BASIC}}
(Add X86 Assembly) |
|||
Line 3,081:
Input your data into L<sub>1</sub> and run this program to organize it.
:L<sub>1</sub>→L<sub>2</sub>
:1+dim(L<sub>2</sub>)→N
:For(D,1,dim(L<sub>2</sub>))
:N-1→N
:0→I
:For(C,1,dim(L<sub>2</sub>)-2)
:For(A,dim(L<sub>2</sub>)-N+1,dim(L<sub>2</sub>)-1)
:If L<sub>2</sub>(A)>L<sub>2</sub>(
:Then
:1→I
| |||