Quick question:
Why? Perl has a builtin based on qsort.

You do note it's inefficient. The builtin finishes the sort of 1,000,000 elements on a P3-650 in 10 seconds.

Mostly I did it because I was bored, and I had never actually coded it before, even though I knew the theory.

--
IndyZ

My guess is that the 100,000 element sort should take about 5 hours. Bubble sort is quadratic, so 10 times the data should take 100 times the time.

After Compline,
Zaxo

     my $temp = @$array[$index + 1];
     @$array[$index + 1] = @$array[$index];
     @$array[$index] = $temp;
[download]

     t=a;
     a=b;
     b=t;
[download]

     (a,b)=(b,a);
[download]

 ($array->[$i+1],$array->[$i])=
         ($array->[$i],$array->[$i+1]);
[download]

Since we can assign into an array slice, it can be shortened down to something like:

@$array[$i,$i+1] = @$array[$i+1,$i];
[download]

See it in action below....

#!/usr/bin/perl -wT
use strict;

my $arrayref = ['A','B','C','D'];
print "Before: ", join(' ',@$arrayref), "\n";

@$arrayref[1,2] = @$arrayref[2,1];         # assign into an array slic
+e

print "After : ", join(' ',@$arrayref), "\n";

=output
Before: A B C D
After : A C B D
[download]

-Blake

# Simple bubble sort, written with an empty loop and with
# some convenience tricks depending on how it is called
sub bbl_sort {
  if (defined wantarray) {
    @_ = wantarray ? @_ : @{shift(@_)};
  }

  SCAN: {
    foreach (0..(@_-2)) {
      if ($_[$_] gt $_[$_+1]) {
        @_[$_, $_+1] = @_[$_+1, $_];
        redo SCAN;
      }
    }
  }

  wantarray ? @_ : [@_];
}

# Try it, showing one of the games
my ($first, $second, $third) = qw(not in order?);
bbl_sort($first, $second, $third);
print map "$_\n", $first, $second, $third;
[download]