function bubbleSort(nums){
let len = nums.length;
let flag = true;
for (let i = 0; i < len && flag; i++) {
flag = false;
for (let j = 0; j < len - i - 1; j++){
if (nums[j] > nums[j+1]){
let swap = nums[j];
nums[j] = nums[j+1];
nums[j+1] = swap;
flag = true;
}
}
}
return nums;
}
console.log(bubbleSort([1, 5, 3, 4, 6, 12, 3]));
**最好的情况:**加入flag判断后面是否有序,如果有序后面就不用交换了。此时复杂度就是O(n)