1. 快速排序
function quickSort(arr) {
if (arr.length < 2) {
return arr;
}
var pivIndex = Math.floor(arr.length/2);
var piv = arr.splice(pivIndex, 1)[0];
var left = [], right = [];
arr.forEach(ele => {
if (ele < piv) {
left.push(ele);
} else {
right.push(ele);
}
});
return quickSort(left).concat(piv, quickSort(right));
}
2. 冒泡排序
function selectSort(arr) {
var tmp;
for(var i = 0; i < arr.length; i++) {
for(var j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[i]) {
tmp = arr[j];
arr[j] = arr[i];
arr[i] = tmp;
}
}
}
return arr;
}
3. 选择排序
function selectSort(arr) {
for (var i = 0; i < arr.length - 1; i++) {
var minIndex = i, min = arr[i];
for (var j = i + 1; j < arr.length; j++) {
if (arr[j] < min) {
min = arr[j];
minIndex = j;
}
}
arr[minIndex] = arr[i];
arr[i] = min;
}
return arr;
}
4. 归并排序
function _merge(left, right) {
var res = [];
while(right.length && left.length) {
if (left[0] < right[0]) {
res.push(left.shift());
} else {
res.push(right.shift());
}
}
return res.concat(left, right);
}
function mergeSort(arr) {
if (arr.length < 2) {
return arr;
}
var pivIndex = Math.floor(arr.length/2);
return _merge(mergeSort(arr.slice(0, pivIndex)), mergeSort(arr.slice(pivIndex)));
}
5. 二分查找
function halfSearch(arr, dest) {
var pivIndex = Math.floor(arr.length/2);
var piv = arr[pivIndex];
var length = arr.length;
if (length === 0) {
return null;
} else if (length === 1) {
return arr[0] === dest ? 0 : null;
} else if(piv == dest) {
return pivIndex;
} else if (piv > dest) {
return halfSearch(arr.slice(0, pivIndex), dest);
} else {
return halfSearch(arr.slice(pivIndex+1), dest);
}
}