2020-01-28 冒泡排序

function bubbleSort(arr) {
  const len = arr.length
  if (len <= 1) return arr

  for (let i = 0; i < len; ++i) {
    let flag = false
    for (let j = 0; j < len - i - 1; ++j) {
      if (arr[j] > arr[j + 1]) {
        let tmp = arr[j]
        arr[j] = arr[j + 1]
        arr[j + 1] = tmp
        flag = true
      }
    }
    if (!flag) break
  }
  return arr
}