数组排序方式

/*
 * @Author: 李灿
 * @Date: 2021-07-04 12:18:54
 * @LastEditTime: 2021-07-18 17:05:34
 * @Description: 数组排序算法
 * @FilePath: /demo/bubble.js
 */
/**
 * @description: 冒泡排序
 * @param {*}
 * @return {*}
 */
function bubble() {
  let arr = [63, 4, 24, 1, 3, 15];
  for (let i = 1; i < arr.length; i++) {
    for (let k = 0; k < arr.length - i; k++) {
      if (arr[k] > arr[k + 1]) {
        [arr[k], arr[k + 1]] = [arr[k + 1], arr[k]];
      }
    }
  }
  return arr;
}
console.log(bubble());

/**
 * @description: 插入排序
 * @param {*}
 * @return {*}
 */
function insert() {
  let arr = [63, 4, 24, 1, 3, 15];
  for (let i = 1; i < arr.length; i++) {
    let index = 0;
    for (let k = 1; k <= arr.length - i; k++) {
      if (arr[k] > arr[index]) {
        index = k;
      }
    }
    [arr[index], arr[arr.length - i]] = [arr[arr.length - i], arr[index]];
  }
  return arr;
}
console.log(insert());

/**
 * @description: 反转排序
 * @param {*}
 * @return {*}
 */
function reverse() {
  let arr = [10, 20, 30, 40, 50, 60];
  const length = Math.floor(arr.length / 2);
  for (let i = 0; i < length; i++) {
    [arr[i], arr[arr.length - i - 1]] = [arr[arr.length - i - 1], arr[i]];
  }
  return arr;
}

console.log(reverse());