Sorting algorithms/Bogosort: Difference between revisions
Content added Content deleted
Drkameleon (talk | contribs) (Added Arturo implementation) |
(Sorting algorithms/Bogosort en Yabasic) |
||
Line 3,422: | Line 3,422: | ||
-5 1 1 2 3 4 4 5 6 9 |
-5 1 1 2 3 4 4 5 6 9 |
||
</pre> |
</pre> |
||
=={{header|Yabasic}}== |
|||
{{trans|FreeBASIC}} |
|||
<lang yabasic> |
|||
sub shuffle(a()) |
|||
n = arraysize(a(),1) |
|||
m = arraysize(a(),1)*2 |
|||
for k = 1 to m |
|||
i = int(Ran(n)) |
|||
j = int(Ran(n)) |
|||
tmp = a(i) //swap a(i), a(j) |
|||
a(i) = a(j) |
|||
a(j) = tmp |
|||
next k |
|||
end sub |
|||
sub inorder(a()) |
|||
n = arraysize(a(),1) |
|||
for i = 0 to n-2 |
|||
if a(i) > a(i+1) then return false : fi |
|||
next i |
|||
return true |
|||
end sub |
|||
sub Bogosort(a()) |
|||
while not inorder(a()) |
|||
shuffle(a()) |
|||
wend |
|||
end sub |
|||
dim a(5) |
|||
a (0) = 10: a (1) = 1: a (2) = 2: a (3) = -6: a (4) = 3 |
|||
Bogosort(a()) |
|||
for i = 0 to arraysize(a(),1) - 1 |
|||
print a(i), " "; |
|||
next i |
|||
end |
|||
</lang> |
|||
=={{header|zkl}}== |
=={{header|zkl}}== |