数组排序

1. 冒泡排序

var arr = [1, 3, 6, 3, 23, 76, 1, 34, 222, 6, 456, 221];
function sort(arr) {
	const len = arr.length;
	if (len < 2) return arr;
	for (let i = 0; i < len; i++) {
		for (let j = 0; j < i; j++) {
			if (arr[j] > arr[i]) {
				const temp = arr[j];
				arr[j] = arr[i];
				arr[i] = temp;
			}
		}
	}
	return arr;
}
sort(arr);
// [1, 1, 3, 3, 6, 6, 23, 34, 76, 221, 222, 456]

2. 快速排序

function quickSort(array) {
	var quick = function (arr) {
		if (arr.length <= 1) return arr;
		const len = arr.length;
		const index = Math.floor(len / 2);
		const mid = arr.splice(index, 1)[0];
		const left = [];
		const right = [];
		for (let i = 0; i < len; i++) {
			if (arr[i] > mid) {
				right.push(arr[i]);
			} else if (arr[i] <= mid) {
				left.push(arr[i]);
			}
		}
		return quick(left).concat([mid], quick(right));
	}
	const result = quick(array);
	return result;
}

3. 插入排序

function insertSort(array) {
	const len = array.length;
	let current, prev;
	for (let i = 1; i < len; i++) {
		current = array[i];
		prev = i - 1;
		while (prev >= 0 && array[prev] > current) {
			array[prev + 1] = array[prev];
			prev--
		}
		array[prev + 1] = current;
	}
	return array;
}