Sorting algorithms/Bogosort: Difference between revisions
Content added Content deleted
Underscore (talk | contribs) (Added Perl.) |
(added python) |
||
| Line 88: | Line 88: | ||
} |
} |
||
}</java> |
}</java> |
||
=={{header|Perl}}== |
=={{header|Perl}}== |
||
<perl>sub bogosort |
<perl>sub bogosort |
||
| Line 109: | Line 110: | ||
{my $k = int rand($n + 1); |
{my $k = int rand($n + 1); |
||
@l[$k, $n] = @l[$n, $k] if $k != $n;}}</perl> |
@l[$k, $n] = @l[$n, $k] if $k != $n;}}</perl> |
||
=={{header|Python}}== |
|||
<python>import random |
|||
def bogosort(l): |
|||
while not in_order(l): |
|||
random.shuffle(l) |
|||
return l |
|||
def in_order(l): |
|||
if not l: |
|||
return True |
|||
last = l[0] |
|||
for x in l[1:]: |
|||
if x < last: |
|||
return False |
|||
last = x |
|||
return True</python> |
|||