<script type="text/javascript" >

    function quickSort(ary) {

// 找到基準點的索引
if(ary.length<=1){
return ary ;
}
var pointIndex = Math.floor(ary.length/2);
// 通過基準點的索引在原來的數(shù)組中，刪除這一項，并把基準點這一項的值獲取到
var pointValue = ary.splice(pointIndex,1)[0];
var left=[];
var right=[];
for(var i=0;i<ary.length;i++) {
var cur = ary[i];
cur < pointValue ? left.push(cur) : right.push(cur);
}
//重新把 左中右 組合到一起
return quickSort(left).concat([pointValue],quickSort(right));

    }
    var  ary = [12,13,23,14,20,26,34,13,16];
    var res = quickSort(ary);
    console.log(res);

</script>