php 排序方法

冒泡排序

冒泡排序（Bubble Sort，台湾译为：泡沫排序或气泡排序）是一种简单的排序算法。它重复地走访过要排序的数列，一次比较两个元素，如果他们的顺序错误就把他们交换过来。走访数列的工>作是重复地进行直到没有再需要交换，也就是说该数列已经排序完成。这个算法的名字由来是因为越大的元素会经由交换慢慢“浮”到数列的顶端，故名。如下图所示：

  

代码实现

<span style="font-size: 14px;"><?php$arr = array( 1, 43, 54, 62, 21, 66, 32, 78, 36, 76, 39);function maopao($arr) {    $len = count($arr);    for ($i = 1; $i < $len; $i++) {         for ($j = 0; $j < $len - $i; $j++) {            if ($arr[$j] > $arr[$j + 1]) {                $tmp = $arr[$j + 1];                $arr[$j + 1] = $arr[$j];                $arr[$j] = $tmp;            }        }    }    return $arr;}print_r(maopao($arr)); </span><h3 class="chapter-title" style="box-sizing: border-box; line-height: 1.1; color: inherit; margin: 0px; padding: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;"><span style="font-size:24px;">插入排序</span></h3><span style="font-size: 14px;">插入排序（Insertion Sort）的算法描述是一种简单直观的排序算法。 </span><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;">它的工作原理是通过构建有序序列，对于未排序数据，在已排序序列中从后向前扫描， 找到相应位置并插入。插入排序在实现上，通常采用in-place排序（即只需用到O(1)的额外空间的排序）， 因而在从后向前扫描过程中，需要反复把已排序元素逐步向后挪位，为最新元素提供插入空间。</p><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;"></p><span style="font-size: 14px;">具体算法描述如下： 步骤1,从第一个元素开始，该元素可以认为已经被排序 步骤2,取出下一个元素，在已经排序的元素序列中从后向前扫描 步骤3,如果该元素（已排序）大于新元素，将该元素移到下一位置 重复步骤3，直到找到已排序的元素小于或者等于新元素的位置 将新元素插入到该位置后 </span><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;">重复步骤2~5</p><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;">如图所示：</p><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;"><img src="http://static.bianbook.com/upload/image/20160708/20160708094852_19229.gif" alt="" style="box-sizing: border-box; border: 0px; vertical-align: middle; outline: 0px; margin: 0px; padding: 0px; max-width: 100%; background: transparent;" /></p><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;"></p><p style="font-size: 15px; box-sizing: border-box; margin-top: 0px; margin-bottom: 22px; padding-top: 0px; padding-bottom: 0px; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; outline: 0px; vertical-align: baseline; color: rgb(102, 102, 102); line-height: 26px; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;">代码实现：</p><pre class="prettyprint lang-php" name="code" style="font-size: 14px; box-sizing: border-box; font-family: 'Microsoft YaHei'; white-space: pre-wrap; padding: 0px; margin-top: 0px; margin-bottom: 0px; line-height: 1.42857; word-break: break-all; word-wrap: break-word; border: 0px; border-image-source: initial; border-image-slice: initial; border-image-width: initial; border-image-outset: initial; border-image-repeat: initial; border-radius: 4px; outline: 0px; vertical-align: baseline; position: relative; overflow-y: hidden; overflow-x: auto; background-image: initial; background-attachment: initial; background-color: transparent; background-size: initial; background-origin: initial; background-clip: initial; background-position: initial; background-repeat: initial;"><?php    function insertSort($arr) {        $len = count($arr);        for ($i = 1; $i < $len; $i++) {            // 当前值              $value = $arr[$i];            // 当前位置              $pos = $i;            // 如是当前位置 >0 && 当前值的前一个值 > 当前值 选出最值              while ($pos > 0 && $arr[$pos - 1] > $value) {                // 当前值  =  前一个值                  $arr[$pos] = $arr[$pos - 1];                // 当前位置后移                  $pos = $pos - 1;            }            // 找到当前值的位置              $arr[$pos] = $value;        }        return $arr;    }<div class="save_code tracking-ad" data-mod="popu_249" style="box-sizing: border-box; margin: 0px; padding: 0px; border: 0px; outline: 0px; vertical-align: baseline; position: absolute; height: 60px; right: 30px; top: 5px; color: rgb(255, 255, 255); cursor: pointer; z-index: 2; background: transparent;"><a target=_blank target="_blank" style="box-sizing: border-box; color: rgb(66, 139, 202); margin: 0px; padding: 0px; outline: none; background: transparent;"><img src="http://static.blog.csdn.net/images/save_snippets.png" style="box-sizing: border-box; border: 0px; vertical-align: middle; outline: 0px; margin: 0px; padding: 0px; max-width: 100%; background: transparent;" alt="" /></a></div>

<?php$ar = array(5,2,4,6,1,3); print_r(insertSort($ar));<div class="save_code tracking-ad" data-mod="popu_249" style="box-sizing: border-box; margin: 0px; padding: 0px; border: 0px; outline: 0px; vertical-align: baseline; position: absolute; height: 60px; right: 30px; top: 5px; color: rgb(255, 255, 255); cursor: pointer; z-index: 2; background: transparent;"><a target=_blank target="_blank" style="box-sizing: border-box; color: rgb(66, 139, 202); margin: 0px; padding: 0px; outline: none; background: transparent;"><img src="http://static.blog.csdn.net/images/save_snippets_01.png" style="box-sizing: border-box; border: 0px; vertical-align: middle; outline: 0px; margin: 0px; padding: 0px; max-width: 100%; background: transparent;" alt="" /></a></div>

快速排序

function quick_sort($arr) {    //先判断是否需要继续进行    $length = count($arr);    if($length <= 1) {        return $arr;    }    //如果没有返回，说明数组内的元素个数 多余1个，需要排序    //选择一个标尺    //选择第一个元素    $base_num = $arr[0];    //遍历 除了标尺外的所有元素，按照大小关系放入两个数组内    //初始化两个数组    $left_array = array();//小于标尺的    $right_array = array();//大于标尺的    for($i=1; $i<$length; $i++) {        if($base_num > $arr[$i]) {            //放入左边数组            $left_array[] = $arr[$i];        } else {            //放入右边            $right_array[] = $arr[$i];        }    }    //再分别对 左边 和 右边的数组进行相同的排序处理方式    //递归调用这个函数,并记录结果    $left_array = quick_sort($left_array);    $right_array = quick_sort($right_array);    //合并左边 标尺 右边    return array_merge($left_array, array($base_num), $right_array);}