Python3~~ 冒泡排序法，时间复杂度O(n2)

def bubbleSort(nums):
    for i in range(len(nums)-1):        # 这个循环负责设置冒泡排序进行的次数
        for j in range(len(nums)-i-1):  # ｊ为列表下标
            if nums[j] > nums[j+1]:
                nums[j], nums[j+1] = nums[j+1], nums[j]
    return nums

nums = [5,2,45,6,8,2,1]
print(len(nums))
print(bubbleSort(nums))

================================================

/Users/apple/PycharmProjects/interview/venv/bin/python /Users/apple/PycharmProjects/interview/sort01.py
7
[1, 2, 2, 5, 6, 8, 45]

Process finished with exit code 0