JavaScript 各种排序算法实现

let arr = [1, 4, 5, 2, 3, 8, 11, 21, 6, 3, 12];
for (let i = 0; i < arr.length; i++) {
    for (let j = 0; j < arr.length - 1 - i; j++) {
        if (arr[j] > arr[j + 1]) {
            [arr[j], arr[j + 1]] = [arr[j + 1], arr[j]]
        }
    }
}

let arr = [1, 4, 5, 2, 3, 8, 11, 21, 6, 3, 12];
for (let index = 0; index < arr.length - 1; index++) {
    let min_index = index;
    for (let j = index; j < arr.length; j++) {
        if (arr[min_index] > arr[j]) {
            min_index = j;
        }
    }
    if (min_index !== index) {
        [arr[index], arr[min_index]] = [arr[min_index], arr[index]]
    }
}