<!DOCTYPE html>
<html>
<head>
<title></title>
</head>
<body>
<script type="text/javascript">
function quickSort(array){
function recursion(arr, left = 0, right = arr.length-1){
if( left>=right ){
return;
}
let i = left;
let j = right;
const baseValue = arr[i];
while(i<j){
while( i<j && baseValue<=arr[j] ){
j--;
}
arr[i] = arr[j];
while( i<j && baseValue>=arr[i] ){
i++;
}
arr[j] = arr[i];
}
arr[j] = baseValue;
recursion(arr, left, i-1);
recursion(arr, i+1, right);
}
let nowArr = array.slice(0);
recursion(nowArr);
return nowArr;
}
console.log(quickSort([4, 8, 1, 9, 2, 7, 6, 4, 5, 2, 14, 12, 4]));
</script>
</body>
</html>
时间复杂度 O(nlogn)
空间复杂度O(n)
