html快速排序,快速排序.html

Title

var arr2 = [13, 4, 35, 67, 86, 24, 86, 34, 76];

function quickSort(arr) {

//如果数组<=1,则直接返回

if (arr.length <= 1) {

return arr;

}

var pivotIndex = arr[arr.length - 1];

//找基准，并把基准从原数组删除

// var pivot=arr.splice(pivotIndex,1)[0];

//定义左右数组

var left = [];

var right = [];

//比基准小的放在left，比基准大的放在right

for (var i = 0; i < arr.length - 1; i++) {

if (arr[i] < pivotIndex) {

left.push(arr[i]);

} else {

right.push(arr[i]);

}

}

//递归

return quickSort(left).concat(pivotIndex, quickSort(right));

}

var result = quickSort(arr2);

console.log(arr2 + '');

console.log(result + '');

var arr = [5, 8, 7, 9, 6, 10, 4, 3, 2, 1];

function quick(array) {

if (array.length <= 1) {

return array;

}

var base = array[0];

var left = [];

var right = [];

for (var i = 0; i < array.length; i++) {

if (array[i] == array[0]) {

continue;

} else if (array[i] < base) {

left.push(array[i]);

} else {

right.push(array[i]);

}

}

return quick(left).concat(base, quick(right));

}

var result2 = quick(arr);

console.log(arr + '');

console.log(result2 + '');

一键复制

编辑

Web IDE

原始数据

按行查看

历史