Js实现快速排序:
var arr = [78, 3, 5, 89, 5, 2];
document.write("原数组: "+ arr +"<br/>" );
function quickSort(arr, flag) {
if (arr.length <= 1) {
return arr;
}
var midIndex = parseInt(arr.length / 2);
var left = [];
var right = [];
for (var i = 0, len = arr.length; i < len; i++) {
if (midIndex == i) {
continue;
}
if (arr[midIndex] > arr[i]) {
left.push(arr[i]);
} else {
right.push(arr[i]);
}
}
return quickSort(left).concat([arr[midIndex]], quickSort(right));
}
document.write("排序后的数组:" + quickSort(arr));