This article mainly introduces the method of implementing array sorting by PHP selection sorting method, and analyzes the principle and specific implementation of selection sorting with examples. The steps have certain reference value. Friends in need can refer to them
This article analyzes the method of implementing array sorting using PHP selection sorting method. Share it with everyone for your reference. The specific analysis is as follows:
The basic idea of the selection sorting method: Let’s use a case to illustrate it. For example, there is an array $arr = array(2,6,3,9), sorted from large to small.
The first big loop: it first assumes that $arr[0] is the maximum value, and then compares it with $arr[1]~$arr[3] respectively. If it is larger, it will be exchanged. The process is as follows (2,6,3,9)---The ratio of 2 and 6--->(6,2,3,9)---The ratio of 6 and 3--->(6,2,3,9 )---6 and 9 ratio--->(9,2,3,6). Note that the subscripts here also need to change.
The second big loop: assuming $arr[1] is the largest ($arr[0] is excluded), compare it with $arr[2]~$arr[3] respectively. The process is as follows (9,2,3 ,6)----2 and 3 ratio---->(9,3,2,6)---3 and 6 ratio--->(9,6,2,3).
The third big loop: Assume $arr[2] is the largest, compare it with $arr[3], the process is like this (9,6,2,3)---2 and 3 ratio--->( 9,6,3,2)
Similarly, after N-1 large cycles, it can be arranged
The PHP code is as follows, which is also encapsulated with functions
?
3 4 5 8
11
13 14 15
|
function selectSort(&$arr){
for($i=0;$i"; print_r($myarr); ?> |