排序算法-冒泡排序

已複製！
const bubbleSort = (nums) {
  const n = nums.length
  for (let i = 0; i < n - 1; i++) {
    for (let j = 0; j < n - 1 - i; j++) {
      if (nums[j] > nums[j + 1]) {
        const t = nums[j]
        nums[j] = nums[j + 1]
        nums[j + 1] = t
      }
    }
  }
  return nums
}