PHP Insert Sort Implementation Code _php tutorial

Algorithm Description:

⒈ starting with the first element, the element can be thought to have been sorted
⒉ takes the next element and scans the sequence of elements that have been sorted from backward forward
⒊ if the element (sorted) is greater than the new element, move the element to the next position
⒋ Repeat step 3 until the sorted element is found to be less than or equal to the position of the new element
⒌ inserting new elements into the next position
⒍ Repeat step 2
Copy the Code code as follows:

$arr =array (123,0,5,-1,4,15);

Function Insertsort (& $arr) {

First, default to the number of 0 is the number of rows
for ($i =1; $i<>
Determining the number of insert comparisons
$insertVal = $arr [$i];
Determine the number of comparisons compared to the previous comparison
$insertIndex = $i-1;

Indicates no location found
while ($insertIndex >=0 && $insertVal < $arr [$insertIndex]) {

Move the number back.
$arr [$insertIndex +1]= $arr [$insertIndex];
$insertIndex--;
}

Insert (Find a location for $insertval)
$arr [$insertIndex +1] = $insertVal;
}
}

Insertsort ($arr);
Print_r ($arr);
?>

http://www.bkjia.com/PHPjc/326682.html www.bkjia.com true http://www.bkjia.com/PHPjc/326682.html techarticle Algorithm Description: ⒈ starting from the first element, the element can be thought to have been sorted ⒉ take out the next element, in the ordered sequence of elements from the back forward scanning ⒊ if the element ...

