上周末参加技术沙龙的路上没事做,就随手写了简单排序算法的JS实现。后续有机会再继续完善,欢迎指正交流。
function bubbleSort(arr) {
let len = arr.length;
let flag = true;
while (flag) {
let hasChange = false;
for (let i = 0; i < len - 1; i++) {
if (arr[i] > arr[i + 1]) {
let temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
hasChange = true;
}
}
if (!hasChange) {
flag = false;
}
}
}
function insertSort(arr) {
let len = arr.length;
for (let i = 1; i < len; i++) {
let currentIdx = i - 1;
while (currentIdx >= 0 && arr[i] < arr[currentIdx]) {
currentIdx--;
}
if (currentIdx !== i - 1) {
arr.splice(currentIdx + 1, 0, arr[i]);
arr.splice(i + 1, 1);
}
}
}
function selectSort(arr) {
let len = arr.length;
for (let i = 1; i < len - 1; i++) {
let handleArr = arr.slice(i);
let min = Math.min.apply(null, handleArr);
let index = handleArr.indexOf(min) + i;
if (index !== i) {
let temp = arr[i];
arr[i] = arr[index];
arr[index] = temp;
}
}
}