冒泡算法

// 冒泡排序

const sortArr = [23, 22, 13, 54, 24, 76, 99];
// js 提供的方法 sort
const afterSortArr = sortArr.sort((a, b) => {
  return a - b;
})
console.log(afterSortArr, ‘js sort 方法排序，其原理也是冒泡排序‘)
const sortArrSpecial = [0, 1, 1, 1, 1, 23, 22, 13, 54, 24, 76, 99, 0, 0, 0, 0, 0, 1, 1];
// js 提供的方法 sort
const afterSortArrSpecial = sortArrSpecial.sort((a, b) => {
  return a - b;
})
console.log(afterSortArrSpecial, ‘js sort 方法排序，其原理也是冒泡排序特殊版‘)

// 冒泡排序 传统方法 (每次比较相邻位置，如果从大到小排列，每次比较完如果小与都互换位置，反之亦然)
const customSortArrDesc = [23, 22, 13, 54, 24, 76, 99];
const customSortArrDescLen = customSortArrDesc.length;
for( let i = 0; i < customSortArrDescLen; i ++) {
  for(let j = 0; j < customSortArrDescLen - 1; j ++) {
    // console.log(customSortArrDesc[j]) // 这里可以打印出看下，交换位置后下次取值还会是上一次取得值
    if(customSortArrDesc[j] > customSortArrDesc[j + 1]) { // 这一行决定从大到小排列还是从小到大排列
      let temporary = customSortArrDesc[j]; // 临时存放
      customSortArrDesc[j] = customSortArrDesc[j + 1];
      customSortArrDesc[j + 1] = temporary;
    }
  }
}
console.log(customSortArrDesc, ‘js 双重for循环方法从大到小冒泡排序‘)
// 升序
const customSortArrAsce = [23, 22, 13, 54, 24, 76, 99];
const customSortArrAsceLen = customSortArrAsce.length;
for( let i = 0; i < customSortArrAsceLen; i ++) {
  for(let j = 0; j < customSortArrAsceLen - 1; j ++) {
    // console.log(customSortArrAsce[j]) // 这里可以打印出看下，交换位置后下次取值还会是上一次取得值
    if(customSortArrAsce[j] < customSortArrAsce[j + 1]) { // 这一行决定从大到小排列还是从小到大排列
      let temporary = customSortArrAsce[j]; // 临时存放
      customSortArrAsce[j] = customSortArrAsce[j + 1];
      customSortArrAsce[j + 1] = temporary;
    }
  }
}
console.log(customSortArrAsce, ‘js 双重for循环方法从小到大冒泡排序‘)