python冒泡排序法完整代码

以下是Python冒泡排序算法的完整代码：

def bubbleSort(nums):
    flag = True
    for i in range(len(nums) - 1):
        for j in range(len(nums) - 1 - i):
            if nums[j] > nums[j + 1]:
                nums[j], nums[j + 1] = nums[j + 1], nums[j]
                flag = False
        if flag:
            break
    return nums

arr = [1, 2697, 300, 40, -5, 6]
print(bubbleSort(arr))  # 输出：[-5, 1, 6, 40, 300, 2697]