冒泡排序
let arr = [3, 4, 1, 2, 9, 6, 6, 4, 9, 2, 122];
function bubbleSort(arr) {
let done = true
for (let i = 0; i < arr.length-1; i++) {
for (let j = 0; j < arr.length - 1 -i; j++) {
if (arr[j] > arr[j+1]) {
let temp = arr[j]
arr[j] = arr[j+1]
arr[j+1] = temp
done = false
}
}
if (done) {break;}
}
return arr
}
console.log(bubbleSort(arr));
快速排序
let arr = [1, 2, 3, 54, 22, 1, 2, 3];
function quick(arr) {
if (arr.length <=1) {
return arr
}
let middle = Math.floor(arr.length / 2)
let data = arr.splice(middle, 1)[0]
let left = []
let right = []
for (let i = 0; i < arr.length; i++) {
if (arr[i] <= data) left.push(arr[i])
else right.push(arr[i])
}
return quick(left).concat([data],quick(right))
}
document.write(quick(arr));
选择排序
let example = [899, 94, 15, 88, 55, 76, 21, 39];
function selectSort(arr) {
let minIndex = 0;
let temp = 0;
console.time('选择排序耗时');
for (let i = 0; i < arr.length - 1; i++) {
minIndex = i;
for (let j = i + 1; j < arr.length ; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
temp=arr[i];
arr[i]=arr[minIndex];
arr[minIndex]=temp;
}
console.timeEnd('选择排序耗时');
return arr;
}
console.log(selectSort(example))