冒泡排序

冒泡排序，就是想魚在水底吐泡一樣，每一次迭代都會將一個當(dāng)前迭代最大或者最小的數(shù)放在尾部，這樣經(jīng)過多次迭代之后，線性表就是有序的了。

Python實現(xiàn)

冒泡排序 - 正序

def bubbleSortWithAsc(nums: list) -> list:
    length = len(nums)
    order = True

    for i in range(1, length):
        for j in range(0, length - i):
            if nums[j] > nums[j + 1]:
                nums[j], nums[j + 1] = nums[j + 1], nums[j]
                order = False
        if order:
            break
    return nums

冒泡排序 - 逆序

def bubbleSortWithDesc(nums: list) -> list:
    length = len(nums)
    order = True

    for i in range(1, length):
        for j in range(0, length - i):
            if nums[j] < nums[j + 1]:
                nums[j], nums[j + 1] = nums[j + 1], nums[j]
                order = False
        if order:
            break
    return nums

參考

https://www.runoob.com/w3cnote/bubble-sort.html