JS 实现快速排序
代码
function Sort(arr, l, r) {
if (l >= r) return;
let i = l, j = r, temp = arr[l];
while (i < j) {
while (i < j && arr[j] >= temp) j--;
arr[i] = arr[j];
while (i < j && arr[i] <= temp) i++;
arr[j] = arr[i];
}
arr[i] = temp;
Sort(arr, l, i - 1);
Sort(arr, i + 1, r);
}
var arr = [10, 10, 1, 2, 4, 6, 7, 89, 7, 4];
Sort(arr, 0, arr.length - 1);
console.log(arr);