Rosetta Code

Sorting algorithms/Bubble sort: Difference between revisions

Page Discussion

Sorting algorithms/Bubble sort (view source)

Revision as of 03:49, 21 February 2007

204 bytes added ,  17 years ago
→‎[[Perl]]: syntax highlight
(→‎[[Perl]]: syntax highlight)
Line 185:
'''Interpreter:''' perl 5.8.8
 
<highlightSyntax language=perl>
# Sorts an array in place and returns a copy
sub bubble_sort (@) {
my $len = @_ - 1;▼
my $len for= my@_ $i- (0..$len-1){;
for my $ji ($i+10 .. $len - 1){
for my @_[$i,$j] = @_[$j,($i] if+ $_[$j]1 lt.. $_[$i];len){
} if ($_[$j] lt $_[$i]) {
@_[$i, $j] = @_[$j, $i];
}▼
return @_; }
}
▲ }
 
return @_;
# Usage
}
@a = qw/G F C A B E D/; ▼
</highlightSyntax>
bubble_sort(@a);▼
 
<highlightSyntax language=perl>
# #usage▼
▲ @a = qw/G F C A B E D/;
▲ bubble_sort(@a);
</highlightSyntax>
 
Alternate "Long Hand" Perl Method
 
<highlightSyntax language=perl>
sub Bubble_Sort {
my @list = @_;
my $temp@list = 0@_;
my $donetemp = 0;
my $elementsdone = $#list + 10;
▲ my $lenelements = @_$#list -+ 1;
 
while ($done == 0) {
while ($done == 0) 1;{
$done for= (my $i=01;$i<$elements;$i++) {
for (my $i = if0; ($list[$i] >< $list[$i+1]elements; && ($i + 1) < $elements+) {
if ($list[$i] > $donelist[$i =+ 1] && ($i + 1) < $elements) 0;{
$tempdone = $list[$i]0;
$list[$i]temp = $list[$i+1];
$list[$i+1] = $templist[$i + 1];
$list[$i + 1] = $temp;
}
}
}
return @list;
}
</highlightSyntax>
 
<highlightSyntax language=perl>
▲ #usage
# usage
my @test = (1, 3, 256, 0, 3, 4, -1);
print join(",", Bubble_Sort(@test));
</highlightSyntax>
 
==[[Python]]==
Nick
14

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/7222"