Insertion Sort In PHP
Insertion Sort In PHP
function insertion_sort4 ($a) {
for ($i = 1; $i < count($a); ++$i) {
/* Assume items before a[i] are sorted. */
/* Pick an number */
$key = $a[$i];
/* Do binary search to find out the point where b is inserted. */
$low = 0; //left
$high = $i; //right
$k = 0;
while ($low - $high = $a[$j]) {
$low = $j + 1;
}
else {
$high = $j;
}
}
/* Shift items between high and i by 1 */
for ($k = $i; $k > $low; $k--) {
$a[$k] = $a[$k - 1];
}
$a[$low] = $key;
}
return $a;
}
One Response 
Leave a Reply 
About Me
Blaine Garrett is a Minneapolis-based web designer, fine artists, and general jack of all trades. When he is not designing next-generation web applications or feverishly painting away, he dabbles in other creative endeavors as well as enjoying the fruits of the luscious Twin Cities.
Copyright © 1997 - 2010 Blaine Garrett All Rights Reserved
A faster insertion sort:
http://www.think-lamp.com/2009/08/fastest-insertion-sort-in-php/
$numbers = array(2,3,4,5,1,8,11,0);
$count = count($numbers);
for($i=1;$i=0 && $numbers[$j] > $key){
$numbers[$j+1] = $numbers[$j];
$numbers[$j]= $key;
$j= $j-1;
}
}
print_r($numbers);