快速排序(php实现)

<?php
function p($myArr,$low,$high){        
    
$key $myArr[$low];        
    while(
$low $high){        
        while(
$low $high &amp;&amp$key <= $myArr[$high]){        
            
$high --;        
        }        
        
$tmp $myArr[$low];        
        
$myArr[$low] = $myArr[$high];        
        
$myArr[$high] = $tmp;        
        while(
$low $high &amp;&amp$key >= $myArr[$low]){        
            
$low ++;        
        }        
        
$tmp $myArr[$low];        
        
$myArr[$low] = $myArr[$high];        
        
$myArr[$high] = $tmp;        
    }        
    return 
$low;        
}        
function 
qSort($myArr,$low,$high){        
    if(
$low $high){        
        
$keysite p($myArr,$low,$high);        
        
qSort($myArr,$low,$keysite-1);        
        
qSort($myArr,$keysite+1,$high);        
    }        
}        
$myArr = array(49,38,65,97,76,13,27);        
qSort($myArr,0,6);        
foreach(
$myArr as $value){        
    echo 
$value.'<br>';        
}        
?>      
原文地址:https://www.cnblogs.com/fancing/p/1690815.html