全面实现PHP排序算法_PHP教程-php教程-PHP中文网

全面实现PHP排序算法_PHP教程

php中文网

发布： 2016-07-15 13:27:29

原创

892人浏览过

算家云

高效、便捷的人工智能算力服务平台

查看详情

学习php时，你可能会遇到 php排序问题，这里将介绍 php排序问题的解决方法，在这里拿出来和大家分享一下。每年总是要隔三差五的看数据结构，每次总是觉得自己很多东西没有学好，唉。

今天贴刚使用php实现4的排序算法，另外堆排序和归并排序没有写。插入排序、选择排序、，冒泡排序，时间复杂度貌似都是 O(N2)，所以实际意义不大，在实际测试中，我对3000个数组元素进行，这三种排序算法都需要花费80秒左右，而快速排序只需要8秒，差距确是比较大，有兴趣的可以自己测试一下。下面我们就详细的看看你PHP排序算法的实现吧。

<OL class=dp-xml><LI class=alt><SPAN><SPAN class=tag><?</SPAN><SPAN> </SPAN></SPAN><LI class=""><SPAN>//插入排序（一维数组）  </SPAN><LI class=alt><SPAN>function insert_sort($arr){  </SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>count</SPAN><SPAN class=attribute-value>count</SPAN><SPAN> = count($arr);  </SPAN></SPAN><LI class=alt><SPAN>for($</SPAN><SPAN class=attribute>i</SPAN><SPAN>=</SPAN><SPAN class=attribute-value>1</SPAN><SPAN>; $i</SPAN><SPAN class=tag><</SPAN><SPAN>$count; $i++){  </SPAN></SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>tmp</SPAN><SPAN> = $arr[$i];  </SPAN></SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>j</SPAN><SPAN> = $i - 1;  </SPAN></SPAN><LI class=""><SPAN>while($arr[$j] </SPAN><SPAN class=tag>></SPAN><SPAN> $tmp){  </SPAN></SPAN><LI class=alt><SPAN>$arr[$j+1] = $arr[$j];  </SPAN><LI class=""><SPAN>$arr[$j] = $tmp;  </SPAN><LI class=alt><SPAN>$j--;  </SPAN><LI class=""><SPAN>}  </SPAN><LI class=alt><SPAN>}  </SPAN><LI class=""><SPAN>return $arr;  </SPAN><LI class=alt><SPAN>}  </SPAN><LI class=""><SPAN> </SPAN><LI class=alt><SPAN> </SPAN><LI class=""><SPAN>//选择排序（一维数组）  </SPAN><LI class=alt><SPAN>function select_sort($arr){  </SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>count</SPAN><SPAN class=attribute-value>count</SPAN><SPAN> = count($arr);  </SPAN></SPAN><LI class=alt><SPAN>for($</SPAN><SPAN class=attribute>i</SPAN><SPAN>=</SPAN><SPAN class=attribute-value>0</SPAN><SPAN>; $i</SPAN><SPAN class=tag><</SPAN><SPAN>$count; $i++){  </SPAN></SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>k</SPAN><SPAN> = $i;  </SPAN></SPAN><LI class=alt><SPAN>for($</SPAN><SPAN class=attribute>j</SPAN><SPAN>=$i+1; $j</SPAN><SPAN class=tag><</SPAN><SPAN>$count; $j++){  </SPAN></SPAN><LI class=""><SPAN>if ($arr[$k] </SPAN><SPAN class=tag>></SPAN><SPAN> $arr[$j])  </SPAN></SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>k</SPAN><SPAN> = $j;  </SPAN></SPAN><LI class=""><SPAN>if ($k != $i){  </SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>tmp</SPAN><SPAN> = $arr[$i];  </SPAN></SPAN><LI class=""><SPAN>$arr[$i] = $arr[$k];  </SPAN><LI class=alt><SPAN>$arr[$k] = $tmp;  </SPAN><LI class=""><SPAN>}  </SPAN><LI class=alt><SPAN>}  </SPAN><LI class=""><SPAN>}  </SPAN><LI class=alt><SPAN>return $arr;  </SPAN><LI class=""><SPAN>}  </SPAN><LI class=alt><SPAN> </SPAN><LI class=""><SPAN>//冒泡排序（一维数组）   </SPAN><LI class=alt><SPAN>function bubble_sort($array){   </SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>count</SPAN><SPAN class=attribute-value>count</SPAN><SPAN> = count($array);   </SPAN></SPAN><LI class=alt><SPAN>if ($count </SPAN><SPAN class=tag><</SPAN><SPAN>= 0) return false;   </SPAN></SPAN><LI class=""><SPAN> </SPAN><LI class=alt><SPAN>for($</SPAN><SPAN class=attribute>i</SPAN><SPAN>=</SPAN><SPAN class=attribute-value>0</SPAN><SPAN>; $i</SPAN><SPAN class=tag><</SPAN><SPAN>$count; $i++){   </SPAN></SPAN><LI class=""><SPAN>for($</SPAN><SPAN class=attribute>j</SPAN><SPAN>=$count-1; $j</SPAN><SPAN class=tag>></SPAN><SPAN>$i; $j--){   </SPAN></SPAN><LI class=alt><SPAN>if ($array[$j] </SPAN><SPAN class=tag><</SPAN><SPAN> $array[$j-1]){   </SPAN></SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>tmp</SPAN><SPAN> = $array[$j];   </SPAN></SPAN><LI class=alt><SPAN>$array[$j] = $array[$j-1];   </SPAN><LI class=""><SPAN>$array[$j-1] = $tmp;   </SPAN><LI class=alt><SPAN>}   </SPAN><LI class=""><SPAN>}   </SPAN><LI class=alt><SPAN>}   </SPAN><LI class=""><SPAN>return $array;   </SPAN><LI class=alt><SPAN>}   </SPAN><LI class=""><SPAN> </SPAN><LI class=alt><SPAN>//快速排序（一维数组）   </SPAN><LI class=""><SPAN>function quick_sort($array){   </SPAN><LI class=alt><SPAN>if (count($array) </SPAN><SPAN class=tag><</SPAN><SPAN>= 1) return $array;   </SPAN></SPAN><LI class=""><SPAN> </SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>key</SPAN><SPAN> = $array[0];   </SPAN></SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>left_arr</SPAN><SPAN> = </SPAN><SPAN class=attribute-value>array</SPAN><SPAN>();   </SPAN></SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>right_arr</SPAN><SPAN> = </SPAN><SPAN class=attribute-value>array</SPAN><SPAN>();   </SPAN></SPAN><LI class=""><SPAN>for ($</SPAN><SPAN class=attribute>i</SPAN><SPAN>=</SPAN><SPAN class=attribute-value>1</SPAN><SPAN>; $i</SPAN><SPAN class=tag><</SPAN><SPAN class=tag-name>count</SPAN><SPAN>($array); $i++){   </SPAN></SPAN><LI class=alt><SPAN>if ($array[$i] </SPAN><SPAN class=tag><</SPAN><SPAN>= $key)   </SPAN></SPAN><LI class=""><SPAN>$left_arr[] = $array[$i];   </SPAN><LI class=alt><SPAN>else   </SPAN><LI class=""><SPAN>$right_arr[] = $array[$i];   </SPAN><LI class=alt><SPAN>}   </SPAN><LI class=""><SPAN>$</SPAN><SPAN class=attribute>left_arr</SPAN><SPAN> = </SPAN><SPAN class=attribute-value>quick_sort</SPAN><SPAN>($left_arr);   </SPAN></SPAN><LI class=alt><SPAN>$</SPAN><SPAN class=attribute>right_arr</SPAN><SPAN> = </SPAN><SPAN class=attribute-value>quick_sort</SPAN><SPAN>($right_arr);   </SPAN></SPAN><LI class=""><SPAN> </SPAN><LI class=alt><SPAN>return array_merge($left_arr, array($key), $right_arr);   </SPAN><LI class=""><SPAN>}   </SPAN><LI class=alt><SPAN> </SPAN><LI class=""><SPAN></SPAN><SPAN class=tag>?></SPAN><SPAN> </SPAN></SPAN></LI></OL>

登录后复制