左数组比右数组的所有数据都要小
* 2.递归调用,在两边都实行快速排序
* */
function quickSort(arr) {
if ( arr.length <= 1 ) {...left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quickSort...(left).concat([pivot],quickSort(right));
};
var arr2 = [5,3,68,12,47,51,2,9,4,1,8,61,37,69,0,1.2,5.3,9.5...];
console.log(quickSort(arr2));