Shell Sort

Nothing special, but I understood many of my friends don't know this kind of sort algorithm.
It is incredibly fast, probably 5-10% slower than Quick Sort. In the same time, it is not recursive,
so you can be sure sort will finish without any issues.

---

	<?
	function shell_sort($a){
	$step = count($a) - 1;
	while ( true ){
	$sorted = false;
	echo sprintf("Step %3d\n", $step);
	while ( ! $sorted ){
	$sorted = true;
	for ($i = 0; $i < count($a); $i++)
	echo sprintf("[ %4d ] ", $a[$i]);
	echo "\n";
	for ($i = 0; $i < count($a) - $step; $i++){
	$j = $i + $step;
	if ($a[$i] > $a[$j]){
	$tmp = $a[$i];
	$a[$i] = $a[$j];
	$a[$j] = $tmp;
	$sorted = false;
	}
	}
	}
	if ($sorted && $step == 1)
	break;
	$step = (int) ($step / 2 + 0.5);
	// $step = (int) ($step / 2);
	if ($step < 1)
	$step = 1;
	}
	return $a;
	}
	$a = array(324,23,2,35,6,333,224,6555,23,2,4,78);
	print_r(shell_sort($a));

view raw shell.php hosted with ❤ by GitHub

Bozo Sort

	<?
	/*
	Bozo Sort written in PHP
	Nikolay Mihaylov Copyleft 2012-03-28, Sofia
	*/
	function is_sorted($a){
	for($i=0; $i < count($a) - 1; $i++)
	if ($a[$i] > $a[$i + 1])
	return false;
	return true;
	}
	function bozo_sort($a){
	$passes = 0;
	while ( is_sorted($a) == false ){
	$passes++;
	while(1){
	$x = rand(0, count($a) - 1);
	$y = rand(0, count($a) - 1);
	if ($x == $y)
	continue;
	if ($x > $y){
	// continue;
	$m = $x;
	$x = $y;
	$y = $m;
	}
	if ($a[$x] > $a[$y]){
	$m = $a[$x];
	$a[$x] = $a[$y];
	$a[$y] = $m;
	break;
	}
	}
	}
	echo "Done in $passes passes/swaps.\n";
	return $a;
	}
	$a = array(324,23,2,35,6,333,224,6555,23,2,4,78);
	print_r(bozo_sort($a));

view raw bozo.php hosted with ❤ by GitHub