优化冒泡排序

最新推荐文章于 2024-08-22 14:32:34 发布

沐小磊|

最新推荐文章于 2024-08-22 14:32:34 发布

阅读量129

点赞数

文章标签： javascript

本文链接：https://blog.csdn.net/m0_64453243/article/details/126677341

版权

冒泡排序算法优化时间复杂度数组排序 JavaScript

关键词由CSDN通过智能技术生成

//基础版  time1: 0.0849609375 ms
function maopao(...arry) {
  let arr = arry
  for (let i = 0; i < arr.length - 1; i++) {

    for (let j = i + 1; j < arr.length; j++) {
      if (arr[i] > arr[j]) {
        let num = arr[i]
        arr[i] = arr[j]
        arr[j] = num
      }
    }
  }
  return arr
}

const res=  maopao(1,9,6,8,10,6,4)
console.log(res);

//优化版  time1: 0.005859375 ms
function maopao(...arry) {
  let arr = arry
console.time('time1')
  for (let i = 0; i < arr.length - 1; i++) {
    let fring = true

    for (let j = i + 1; j < arr.length; j++) {
      if (arr[i] > arr[j]) {
        let num = arr[i]
        arr[i] = arr[j]
        arr[j] = num
        fring = false
      }
    }
    if (fring) {
      break
    }
  }
  console.timeEnd('time1')
  return arr
}

const res=  maopao(1,9,6,8,10,6,4)
console.log(res);