数据结构_冒泡排序

//冒泡排序
  class ArrayList {
    constructor () {
      this.array = []
    }
    insert (data) {
      return this.array.push(data)
    }
    tostring () {
      return this.array.join('-')
    }
    bubbleSort () {
      //获取数组长度
      let length = this.array.length
      let array = this.array
      for (let i = length-1; i > 0; i--) {
        for (let j = 0; j < i; j++) {
          if (array[j] > array[j+1]) {
            [[array[j]], array[j+1]] = [[array[j+1]], array[j]] 
          }
        }
      }
      return true
    }
  }
  let arr = new ArrayList()
  arr.insert(9)
  arr.insert(5)
  arr.insert(8)
  arr.insert(0)
  arr.insert(1)
  arr.insert(6)
  arr.insert(4)
  arr.insert(7)
  arr.insert(3)
  arr.insert(2)

 

来源：https://www.cnblogs.com/JunLan/p/12363615.html