Insertion sort is efficient algorithm for sorting a small number of elements. Typical example is sorting cards.
// The array to be sorted
$array = array(5, 2, 4, 6, 1, 3);
foreach($array as $i => $value){
$j = $i + 1;
while (($j < count($array) && ($array[$j] < $array[$i])))
{
$tmp = $array[$i];
$array[$i] = $array[$j];
$array[$j] = $tmp;
if ($i > 0)
{
$i--;
}
$j--;
}
}
print_r($array);

