Home >php教程 >php手册 >php 实例代码:各种排序的算法

php 实例代码:各种排序的算法

WBOY
WBOYOriginal
2016-06-13 11:37:101245browse

//冒泡排序
function maopao_sort($demo){
$num = count($demo);
for($i=0;$ifor($j=$num-1;$j>$i;$j--){
if($demo[$j]$temp = $demo[$j];
$demo[$j]=$demo[$j-1];
$demo[$j-1]= $temp;
}
}
}
return $demo;
}

//插入排序
function charu_sort($demo){
$num = count($demo);
for($i=1;$i$temp=$demo[$i];
$dqweizhi = $i-1;//记录当前位置
while(($dqweizhi>=0)&&($temp$demo[$dqweizhi+1] = $demo[$dqweizhi];
$dqweizhi--;
}
$demo[$dqweizhi+1] = $temp;
}
return $demo;
}

//选择法排序
function select_sort($demo){
$num = count($demo);
for($i=0;$i$temp=$demo[$i];
$dqweizhi=$i;
for($j=$i+1;$jif($demo[$j]$temp=$demo[$j];
$dqweizhi=$j;
}
}
$demo[$dqweizhi]=$demo[$i];
$demo[$i]=$temp;
}
return $demo;
}

//快速排序
function quick_sort($demo)
{
$num = count($demo);
if($numreturn $demo;
}
$key=$demo[0];
$left_array=array();
$right_array=array();
for($i=1;$iif($demo[$i]$left_array[]=$demo[$i];
}else{
$right_array[]=$demo[$i];
}
}
$left_array =quick_sort($left_array);
$right_array=quick_sort($right_array);
return array_merge($left_array,array($key),$right_array);
}

$test = array('43','154','3','78','13','284','167','2','56','2234','121','57','345');
$sss = quick_sort($test);
var_dump($sss);
?>

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn