a.内部排序（直接加载到内存进行排序）:包括交换式排序（冒泡和快速法）、选择式排序、插入式排序b.外部排序（因数据量大，需借助外部存储进行排序）：包括合并排序、直接合并排序
 【选择排序：第二个数至第n个数分别与第一个数比较，进行交换，第三个数至第n个数分别与第二个数比较，进行交换，直到排完】
 代码如下 复制代码
function selectsort($arr,$style)
             {
                 $temp=0;
                 for($i=0;$i                 {
                     for($j=$i+1;$j                     {
                         if($style=='bts') $op=$arr[$i]                         else if($style=='stb') $op=$arr[$i]>$arr[$j];
                         if($op)
                         {
                             $temp=$arr[$i];
                             $arr[$i]=$arr[$j];
                             $arr[$j]=$temp;
                         }
                     }
                 }
                 foreach ($arr as $key => $value)
                 {
                     echo $value.',';   
                 }
             }
             $arr1=array(21.5,33,90,7,-4,5,55,11);
             selectsort($arr1,'stb');
【默认传递的是值，不是地址。如果在$arr前加个&，则和$arr1指向同一个地址，函数外的$arr1也被排好了】
 代码如下 复制代码
function maopao($arr,$style)    {
                 $temp=0;
                 for($i=0;$i                 {
                     for($j=0;$j                     {
                         if($style=='bts') $op=$arr[$j]                         else if($style=='stb') $op=$arr[$j]>$arr[$j+1];
                         if($op)
                         {
                             $temp=$arr[$j];
                             $arr[$j]=$arr[$j+1];
                             $arr[$j+1]=$temp;
                         }
                     }
                 }
                 foreach ($arr as $key => $value)
                 {
                     echo $value.',';   
                 }
             }
             $arr1=array(101,101,-9,-8,0,76,1,57,43,90,23,-56);
             maopao($arr1,'stb');//small to big
【插入排序：第二个与第一个比较，交换，第三个与前两个比较，交换。。。。第n个与前n-1个比较，交换】
 代码如下 复制代码
function insertsort($arr,$style)
             {
                 $temp=0;
                 for($i=1;$i                 {
                     for($j=0;$j                     {
                         if($style=='bts') $op=$arr[$j]                         else if($style=='stb') $op=$arr[$j]>$arr[$i];
                         if($op)
                         {
                             $temp=$arr[$j];
                             $arr[$j]=$arr[$i];
                             $arr[$i]=$temp;
                         }
                     }
                 }
                 foreach ($arr as $key => $value)
                 {
                     echo $value.',';   
                 }
             }
             $arr1=array(4,7,0,-7,1,14,5);
             insertsort($arr1,'bts');
http://www.bkjia.com/phpjc/631612.htmlwww.bkjia.comtruehttp://www.bkjia.com/phpjc/631612.htmltecharticlea.内部排序（直接加载到内存进行排序）:包括交换式排序（冒泡和快速法）、选择式排序、插入式排序b.外部排序（因数据量大，需借助外部...