加入提前停止的冒泡排序
def BubbleSort(nums):
n = len(nums)
exchange_cnt = 1
while exchange_cnt > 0:
exchange_cnt = 0
for i in range(1, n):
if nums[i] < nums[i - 1]:
exchange_cnt += 1
nums[i - 1], nums[i] = nums[i], nums[i - 1]
n -= 1
return nums