PHP implements four fundamental sorting algorithms

PHP implementation of four basic sorting algorithms

Many people say that the algorithm is the core of the program, the quality of the algorithm determines the program. As a primary phper, although it is seldom exposed to algorithmic aspects of things. However, the basic sorting algorithm should be mastered, it is a necessary tool for program development. Here we introduce bubble sort, insert sort, choose Sort, quick sort four basic algorithms, analyze the idea of algorithm.

Premise: The bubble sorting method, the fast sorting method, the selection of sorting method, the insertion of the sorting method in the following array of values in order from small to large orders.
$arr (1,43,54,62,21,66,32,78,36,76,39);
1. Bubble sort

Thinking Analysis: In order to sort a group of numbers, the current is not well-arranged sequence, from the back to the adjacent two numbers in turn to compare and adjust, so that the larger number to sink, smaller upward. That is, each time a comparison of two adjacent numbers finds that they are ordered in the opposite order as they are ordered, they are interchanged.

Code implementation:

Java code

2. $arr =array (1,--------- ( a);
4. function Bubblesort ($arr)
6. {
8. $len =count ($arr);
10. The layer loop controls the number of rounds that need to bubble
12. For($i =1; $i < $len; $i + +)
14. { //This layer loop is used to control the number of times a number needs to be compared per round
16. For($k =0; $k < $len-$i; $k + +)
18. {
20. If($arr [$k]> $arr [$k +1])
22. {
24. $tmp = $arr [$k +1];
26. $arr [$k +1]= $arr [$k];
28. $arr [$k]= $tmp;
30. }
32. }
34. }
36. return $arr;
38. }

2. Select Sort

Thinking analysis: In the group of numbers to be sorted, select the smallest number to exchange with the number of the first position. Then in the remaining number, find the smallest and second position of the number of exchanges, so loop to the penultimate number and the last number comparison.

Code implementation:

Java code

2. function Selectsort ($arr) {
4. Double loop complete, outer control wheel count, inner control comparison number
6. $len =count ($arr);
8. For($i =0; $i < $len-1; $i + +) {
10. First assume the position of the smallest value
12. $p = $i;
16. For($j = $i +1; $j < $len; $j + +) {
18. $arr [$p] is the currently known minimum value
20. If($arr [$p] > $arr [$j]) {
22. Compare, find smaller, record the position of the minimum value, and compare with the known minimum value at the next comparison.
24. $p = $j;
26. }
28. }
30. The location of the current minimum value has been determined and saved to $p. If the location of the minimum value is found to be different from the current assumed position $i, the position is interchangeable.
32. If($p! = $i) {
34. $tmp = $arr [$p];
36. $arr [$p] = $arr [$i];
38. $arr [$i] = $tmp;
40. }
42. }
44. Return to final result
46. return $arr;
48. }

3. Insert Sort

Thinking Analysis: In order to sort a group of numbers, assuming that the previous number is already in the sequence, now the nth number is inserted into the ordinal number in front, so that the number of n is also in order. This cycle is repeated until all the rows are in order.
Code implementation:

Java code

2. function Insertsort ($arr) {
4. $len =count ($arr);
6. for ($i =1, $i < $len; $i + +) {
8. $tmp = $arr [$i];
10. Inner loop control, compare and insert
12. For($j = $i-1; $j >=0; $j-) {
14. If($tmp < $arr [$j]) {
16. Find the inserted element to be small, swap position, swap the element behind with the previous element
18. $arr [$j +1] = $arr [$j];
20. $arr [$j] = $tmp;
22. } Else {
24. If you encounter an element that does not need to be moved, because the array is already sorted, the preceding one does not need to be compared again.
26. Break;
28. }
30. }
32. }
34. return $arr;
36. }

4. Quick Sort

Thinking Analysis: Select a datum element, usually select the first element or the last element. With a scan, the pending sequence is divided into two parts, some smaller than the Datum element, and a portion greater than or equal to the datum element. At this point the datum element is in the correct position after it is ordered, and then the same method is used to sort the two parts recursively.

Code implementation:

Java code

2. function QuickSort ($arr) {
4. Determine if you need to proceed
6. $length = count ($arr);
8. If($length <= 1) {
10. return $arr;
12. }
14. Select the first element as a datum
16. $base _num = $arr [0];
18. Iterates through all elements except the ruler, and fits into two arrays in relation to size
20. Initialize two arrays
22. $left _array = Array (); //Less than the baseline
24. $right _array = Array (); //greater than the benchmark
26. For($i =1; $i < $length; $i + +) {
28. If($base _num > $arr [$i]) {
30. Put in the left array
32. $left _array[] = $arr [$i];
34. } Else {
36. Put it on the right
38. $right _array[] = $arr [$i];
40. }
42. }
44. This function is recursively called on the left and right arrays by the same sort method.
46. $left _array = Quick_sort ($left _array);
48. $right _array = Quick_sort ($right _array);
50. Merging
52. Return Array_merge ($left _array, Array ($base _num), $right _array);
54. }

1/ F FEIMENGV

good sorting method, it is important to use rationally, improve the efficiency of the program!

