Sorting algorithms/Bogosort: Difference between revisions
Content added Content deleted
(→{{header|TI-83 BASIC}}: Added ti83b) |
(→{{header|TI-83 BASIC}}: added ti83b bogosort) |
||
Line 1,107: | Line 1,107: | ||
=={{header|TI-83 BASIC}}== |
=={{header|TI-83 BASIC}}== |
||
Same IO as BozoSort (below). |
|||
:"BOGO" |
|||
:L<sub>1</sub>→L<sub>2</sub> |
|||
:Lbl A |
|||
:dim(L<sub>2</sub>)→A |
|||
:For(B,1,dim(L<sub>2</sub>)-1) |
|||
:randInt(1,A)→C |
|||
:L<sub>2</sub>(C)→D |
|||
:L<sub>2</sub>(A)→L<sub>2</sub>(C) |
|||
:D→L<sub>2</sub>(A) |
|||
:A-1→A |
|||
:End |
|||
:For(D,1,dim(L<sub>2</sub>)-1) |
|||
:If L<sub>2</sub>(D)>L<sub>2</sub>(D+1) |
|||
:Goto A |
|||
:End |
|||
:DelVar A |
|||
:DelVar B |
|||
:DelVar C |
|||
:DelVar D |
|||
:Return |
|||
This isn't a bogosort, but a bozosort. Store input into L<sub>1</sub>, run prgmSORTBOZO, outputs to L<sub>2</sub> |
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> |
:L<sub>1</sub>→L<sub>2</sub> |