Sorting algorithms/Bubble sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,028: / Line 2,028: @@
 </lang>
+	#!/usr/bin/perl
-=={{header|Perl}}==
-<lang perl># Sorts an array in place
-sub bubble_sort {
+	sub bubblesort {
-    for my $i (0 .. $#_){
+	    my $array = shift;
-        for my $j ($i + 1 .. $#_){
-            $_[$j] < $_[$i] and @_[$i, $j] = @_[$j, $i];
+	    my $i;         # The initial index for the bubbling scan.
+	    my $j;         # The running index for the bubbling scan.
-        }
+	    my $ncomp = 0; # The number of comparisons.
-    }
+	    my $nswap = 0; # The number of swaps.
-}</lang>
+	    for ( $i = $#$array; $i; $i-- ) {
-Usage:
+	        for ( $j = 1; $j <= $i; $j++ ) {
-<lang perl>my @a = (39, 25, 30, 28, 36, 72, 98, 25, 43, 38);
+	            $ncomp++;
+	            # Swap if needed.
-bubble_sort(@a);</lang>
+	            if ( $array->[ $j - 1 ] gt $array->[ $j ] ) {
+	                @$array[ $j, $j - 1 ] = @$array[ $j - 1, $j ];
+	                $nswap++;
+	            }
+	        }
+	    }
+	    print "bubblesort:  ", scalar @$array,
+	          " elements, $ncomp comparisons, $nswap swaps\n";
+	}
+	@array = qw(question auteurity and eat the rich goodness of duncan hines);
+	bubblesort \@array;
+	print "@array\n";
 =={{header|Perl 6}}==