easyspider - QueryServer - contrib - sorting - SOURCE CODE

#!/usr/bin/perl

# implementation of the heap sort algorithm for demonstration and testing
# purposes.
#
# written and  by Jan 'jast' Krger, 2003.
# See the enclosed file COPYING for license details.

use warnings;
use strict;

# candy initialisation
my $swaps = 0;
my $compares = 0;
my $c2 = "\x1b[1;32m";
my $c1 = "\x1b[1;31m";
my $c0 = "\x1b[0;37m";

# swaps two array values
sub swap
{
	my ($ar, $a, $b) = @_[0..2];
	my $t;
	$t = $ar->[$b];
	$ar->[$b] = $ar->[$a];
	$ar->[$a] = $t;
	$swaps+=3;
}

# compares two array values
sub cmpaa
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $ar->[$b];
}

# compares an array value with a scalar
sub cmpav
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $b;
}

# compares two scalars
sub cmpvv
{
	$compares++;
	$_[0] <=> $_[1];

... [truncated, 67 more lines] ...

#!/usr/bin/perl

# implementation of the merge sort algorithm for demonstration and testing
# purposes.
#
# written and  by Jan 'jast' Krger, 2003.
# See the enclosed file COPYING for license details.

use warnings;
use strict;

# candy initialisation
my $swaps = 0;
my $compares = 0;
my $c2 = "\x1b[1;32m";
my $c1 = "\x1b[1;31m";
my $c0 = "\x1b[0;37m";

sub swap
{
	my ($ar, $a, $b) = @_[0..2];
	my $t;
	$t = $ar->[$b];
	$ar->[$b] = $ar->[$a];
	$ar->[$a] = $t;
	$swaps+=3;
}

sub cmpaa
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $ar->[$b];
}

sub cmpav
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $b;
}

sub cmpvv
{
	$compares++;
	$_[0] <=> $_[1];
}

sub mergesort
{

... [truncated, 47 more lines] ...

#!/usr/bin/perl

# implementation of the quicksort algorithm for demonstration and testing
# purposes.
#
# written and  by Jan 'jast' Krger, 2003.
# See the enclosed file COPYING for licence details.

use warnings;
use strict;

# candy initialisation
my $swaps = 0;
my $compares = 0;
my $c2 = "\x1b[1;32m";
my $c1 = "\x1b[1;31m";
my $c0 = "\x1b[0;37m";

sub swap
{
	my ($ar, $a, $b) = @_[0..2];
	my $t;
	$t = $ar->[$b];
	$ar->[$b] = $ar->[$a];
	$ar->[$a] = $t;
	$swaps++;
}

sub cmpaa
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $ar->[$b];
}

sub cmpav
{
	my ($ar, $a, $b) = @_[0..2];
	$compares++;
	$ar->[$a] cmp $b;
}

sub cmpvv
{
	$compares++;
	$_[0] <=> $_[1];
}

sub part
{

... [truncated, 50 more lines] ...