Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|TI-83 Basic}}: Fixed <sub>
(Added ti83b) |
(→{{header|TI-83 Basic}}: Fixed <sub>) |
||
Line 1,170:
=={{header|TI-83 Basic}}==
Input your data into L<sub>1</sub> and run this program to organize it.
:dim(L<sub>1</sub>)→B▼
:Lbl A▼
▲:dim(L<sub>1</sub>)→B
:0→A▼
▲:Lbl A
:B-1→B▼
▲:0→A
:For(C,1,B)▼
▲:B-1→B
:If L<sub>1</sub>(C)>L<sub>1</sub>(C+1)▼
▲:For(C,1,B)
:Then▼
▲:If L<sub>1</sub>(C)>L<sub>1</sub>(C+1)
▲:Then
:L<sub>1</sub>(C+1)→L<sub>1</sub>(C)
:
:DelVar D▼
▲:D→L<sub>1</sub>(C+1)
:1→A▼
▲:DelVar D
:End▼
▲:1→A
:If (A=1)
▲:End
:
=={{header|Tcl}}==
| |||