This article introduces how to use PHP to sort inserts, if you have a need, you can refer to the basic operation of inserting sorting data into ordered data that has already been sorted to get a new ordered data with a plus of numbers.
Algorithm description:
The sequence starts with the first element, which can be considered to have been sorted.
Extract the next element and scan the sorted element sequence from the back to the front.
If this (sorted) element is greater than the new one, move the element to the next position.
Repeat step 3 until you find the position where the sorted elements are smaller than or equal to the new elements.
Insert the new element to the next position.
Repeat step 2.
The code is as follows:
$ Arr = array (, 0, 5,-, 15 );
Function insertSort (& $ arr ){
// First, the first subscript is 0 by default.
For ($ I = 1; $ I // Determine the number of inserted comparisons
$ InsertVal = $ arr [$ I];
// Determine the number comparison with the previous comparison
$ InsertIndex = $ I-1;
// The location is not found.
While ($ insertIndex> = 0 & $ insertVal <$ arr [$ insertIndex]) {
// Move the number back
$ Arr [$ insertIndex + 1] = $ arr [$ insertIndex];
$ InsertIndex --;
}
// Insert (locate $ insertval)
$ Arr [$ insertIndex + 1] = $ insertVal;
}
}
InsertSort ($ arr );
Print_r ($ arr );
?>