PHP Insert Sort

Insert sort is actually the same as Hill sort, remember that the hill sort begins to define a $d (divided into $l/$d groups)? Insert sort you just need to change that $d to 1, meaning, no grouping, only one group.

Code:

function Insertsort ($a) {$l = count ($a);    for ($i =1; $i < $l; $i + +) {$t = $a [$i];    $j = $i-1;      while ($j >=0 && $a [$j]> $t) {$a [$j +1] = $a [$j];    $j--;  } $a [$j +1] = $t; } return $a;}

Usage:

Echo (Implode (",", Insertsort ($a)));//$a is an unordered array, such as $a = range (1,100); shuffle ($a);

Well, and Hill sort of look at it? Is it just the $d = Floor ($l/2); Instead of $d = 1?

This article is from "A Tangled PHP programmer" blog, please be sure to keep this source http://johnsylm.blog.51cto.com/1480623/1429331