冒泡排序

冒泡排序是数据排序的一种方式，该排序的方式较为简单，主要为两两元素判断大小并交换位置。

冒泡图：

源码：

# @Author Winter
# @Date 2023.02.20
# Example for Bubble sorting at below.

# @parmas elemList: A list of number.
# @params isAscendingSort: Sorting order, default to grow up.
# @return null
def bubble_sort(elemList, isAscendingSort=True):
    for i in range(0, len(elemList)):
        for j in range(0, len(elemList) - 1):
            if isAscendingSort:
                if(elemList[i] < elemList[j]):
                    temp = elemList[i]
                    elemList[i] = elemList[j]
                    elemList[j] = temp
            else:
                if(elemList[i] > elemList[j]):
                    temp = elemList[i]
                    elemList[i] = elemList[j]
                    elemList[j] = temp
    print(elemList)


if __name__ == "__main__":
    elemList = [0, 12, 2, 8, 3]
    bubble_sort(elemList)