Anonymous user
Sorting algorithms/Bogosort: Difference between revisions
→{{header|TI-83 BASIC}}: Added ti83b
(Mathematica) |
(→{{header|TI-83 BASIC}}: Added ti83b) |
||
Line 1,105:
return $list
}</lang>
=={{header|TI-83 BASIC}}==
This isn't a bogosort, but a bozosort. Store input into L<sub>1</sub>, run prgmSORTBOZO, outputs to L<sub>2</sub>
:L<sub>1</sub>→L<sub>2</sub>
:Lbl T
:0→B
:For(A,1,dim(L<sub>2</sub>)-1)
:If L<sub>2</sub>(A)>L<sub>2</sub>(A+1)
:1→B
:End
:If B=0
:Goto E
:randInt(1,dim(L<sub>2</sub>))→C
:randInt(1,dim(L<sub>2</sub>))→D
:L<sub>2</sub>(C)→E
:L<sub>2</sub>(C+1)→L<sub>2</sub>(C)
:E→L<sub>2</sub>(C+1)
:Goto T
:Lbl E
:DelVar A
:DelVar B
:DelVar C
:DelVar D
:DelVar E
:Stop
=={{header|Ursala}}==
| |||