冒泡排序—C—Python

1-2 冒泡排序 时间复杂度为O(N^2)
C实现， 从小到大排序
第一种：从前往后依次两两相邻比较，每一趟将一个最大数归位

第二种：将第一个位置的数依次与后面没个数比较，然后第一个位置的数归为；再依次将第二个、、、第n-1个位置的数依次与后面比较

Python实现

def bubble_sort(lists):
    # 冒泡排序1
    count = len(lists)
    for i in range(0, count-1):
        for j in range(0, count-i-1):
            if lists[j] > lists[j+1]:
                lists[j], lists[j+1] = lists[j+1], lists[j]

# def bubble_sort(lists):
#     # 冒泡排序2
#     count = len(lists)
#     for i in range(0, count-1):
#         for j in range(i+1, count):
#             if lists[i] > lists[j]:
#                 lists[i], lists[j] = lists[j], lists[i]

if __name__=='__main__':
    eles = input('intput elements:').strip().split()
    list = [int(ele) for ele in eles]
    bubble_sort(list)
    print(list)