Sorting algorithms/Bubble sort: Difference between revisions
Content added Content deleted
m (→[[Toka]]: Added full example and further comments) |
m (→[[Perl]]) |
||
Line 206: | Line 206: | ||
'''Interpreter:''' perl 5.8.8 |
'''Interpreter:''' perl 5.8.8 |
||
⚫ | |||
<highlightSyntax language=perl> |
|||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
my $ |
for my $i (0 .. $len - 1){ |
||
for my $ |
for my $j ($i + 1 .. $len){ |
||
if ($_[$j] lt $_[$i]) { |
|||
@_[$i, $j] = @_[$j, $i]; |
|||
} |
|||
} |
|||
} |
|||
return @_; |
|||
⚫ | |||
⚫ | |||
⚫ | |||
</highlightSyntax> |
|||
⚫ | |||
<highlightSyntax language=perl> |
|||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
</highlightSyntax> |
|||
Alternate "Long Hand" Perl Method |
Alternate "Long Hand" Perl Method |
||
⚫ | |||
<highlightSyntax language=perl> |
|||
⚫ | |||
⚫ | |||
my |
my $temp = 0; |
||
my $ |
my $done = 0; |
||
my $ |
my $elements = $#list + 1; |
||
⚫ | |||
while ($done == 0) { |
|||
$done = 1; |
|||
$ |
for (my $i = 0; $i < $elements; $i++) { |
||
if ($list[$i] > $list[$i + 1] && ($i + 1) < $elements) { |
|||
$done = 0; |
|||
$ |
$temp = $list[$i]; |
||
$ |
$list[$i] = $list[$i + 1]; |
||
$list[$i + 1] = $temp; |
|||
} |
|||
} |
|||
} |
|||
} |
|||
return @list; |
return @list; |
||
} |
} |
||
</highlightSyntax> |
|||
<highlightSyntax language=perl> |
|||
⚫ | |||
⚫ | |||
⚫ | |||
</highlightSyntax> |
|||
⚫ | |||
⚫ | |||
⚫ | |||
==[[Pop11]]== |
==[[Pop11]]== |