examples/perl/sort-stupid.plPerl
#!/usr/bin/perl

use warnings;

sub stupidSort
{
	my $flag=1;
	while($flag)
	{
		for(my $i=0; $i<@_-1; $i++)
		{
			if($_[$i]>$_[$i+1])
			{
				@_[$i, $i+1]=@_[$i+1, $i];
				last;
			}
		}
		$flag=0;
	}
	return @_;
}

print "$_\n" for stupidSort(@ARGV);

examples/perl/sort-shaker.plPerl
#!/usr/bin/perl

use warnings;

sub shakerSort
{
	my $left=0;
	my $right=$#_;

	while($left<$right)
	{
		my $lastSwap;

		for(my $i=$lastSwap=$left; $i<$right; $i++)
		{
			if($_[$i]>$_[$i+1])
			{
				@_[$i, $i+1]=@_[$i+1, $i];
				$lastSwap=$i;
			}
		}
		$right=$lastSwap;

		for(my $i=$lastSwap=$right; $i>$left; $i--)
		{
			if($_[$i]<$_[$i-1])
			{
				@_[$i, $i-1]=@_[$i-1, $i];
				$lastSwap=$i;
			}
		}
		$left=$lastSwap;
	}
	return @_;
}

print "$_\n" for shakerSort(@ARGV);

examples/perl/sort-insertion.plPerl
#!/usr/bin/perl

use warnings;

sub insertionSort
{
	for my $i(0..$#_)
	{
		for my $j(0..$i-1)
		{
			if($_[$j]>$_[$i])
			{
				while($j<$i)
				{
					@_[$i, $i-1]=@_[$i-1, $i];
					$i--;
				}
				last;
			}
		}
	}
	return @_;
}

print "$_\n" for insertionSort(@ARGV);

examples/perl/sort-selection.plPerl
#!/usr/bin/perl

use warnings;

sub selectionSort
{
	for my $i(0..$#_-1)
	{
		my $k=$i;
		for my $j($i+1..$#_)
		{
			$k=$j if $_[$k]>$_[$j];
		}
		@_[$i, $k]=@_[$k, $i];
	}
	return @_;
}

print "$_\n" for selectionSort(@ARGV);

examples/perl/sort-tree.plPerl
#!/usr/bin/perl

use warnings;

sub treeAddElement
{
	my $tree=shift;
	my $n=shift;
	if(@$tree)
	{
		treeAddElement($tree->[$n<$tree->[0]? 1: 2], $n);
	}
	else
	{
		@$tree=($n, [], []);
	}
}

sub treeToArray
{
	my $tree=shift;
	return () unless @$tree;
	return (treeToArray($tree->[1]), $tree->[0], treeToArray($tree->[2]));
}

sub treeSort
{
	my $tree=[];
	treeAddElement($tree, $_) for @_;
	return treeToArray($tree);
}

print "$_\n" for treeSort(@ARGV);

examples/perl/sort-quick.plPerl
#!/usr/bin/perl

use warnings;

sub recursiveSort
{
	return () unless @_;
	my $key=shift;
	my @left;
	my @right;
	for(@_)
	{
		if($_<$key)	{ push @left, $_; }
		else		{ push @right, $_; }
	}
	return (recursiveSort(@left), $key, recursiveSort(@right));
}

print "$_\n" for recursiveSort(@ARGV);

examples/perl/sort-clever.plPerl
#!/usr/bin/perl

use warnings;

print "$_\n" for sort { $a<=>$b } @ARGV;