复制代码 代码如下:
l = [6, 2, 4, 1, 98, 34, 5, 9, 23, 8, 10, 32]


//冒泡排序



//快速排序


//选择排序



//插入排序


//木桶排序


//鸽巢排序,非负整数


//归并排序







//堆排序

/*function heapSort(arr) {
var findRoot = function(arr, p, length) {
p = p || 0;
length = length || arr.length;
var self = arguments.callee;
var l = p * 2 + 1;
var r = (p + 1) * 2;
var left, right;

if (l < length) left = self(arr, l, length);
if (r < length) right = self(arr, r, length);
if (left > arr[p]) arr[p] = [left, arr[l] = arr[p]][0];
if (right > arr[p]) arr[p] = [right, arr[r] = arr[p]][0];

return arr[p];
};


for (var i = arr.length; i > 0; i--) {
findRoot(arr, 0, i);
arr[i - 1] = [arr[0], arr[0] = arr[i - 1]][0];
}
return arr;
}

var results = heapSort(l)
console.log(results)*/



//奇偶排列



function oddEvenSort(arr) {
var swaped = true;
while (swaped) {
swaped = false;
for (var i = 0; i < arr.length; i += 2) {
if (arr[i] > arr[i + 1]) {
arr[i] = [arr[i + 1], arr[i + 1] = arr[i]][0];
swaped = true;
}
}
for (var i = 1; i < arr.length; i += 2) {
if (arr[i] > arr[i + 1]) {
arr[i] = [arr[i + 1], arr[i + 1] = arr[i]][0];
swaped = true;
}
}
}
return arr;
}

var results = oddEvenSort(l)
console.log(results)