python//Jan.21th,2020//冒泡排序

# 冒泡排序，每次寻找最小到元素往前排，
#就像汽水从下往上冒一样。所以叫冒泡排序啦
def simpleSort(array):
    for i in range(len(array) - 1):
        for j in range(i, len(array)):
            if array[i] > array[j]:
                temp = array[i]
                array[i] = array[j]
                array[j] = temp
    return array


#print(simpleSort([9, 8, 6, 7, 4, 5, 3, 11, 2]))  
# [2, 3, 4, 5, 6, 7, 8, 9, 11]

def bubblesort(arr):
    for i in range(len(arr)-1):
        for j in range(i,len(arr)):
            if arr[i]>arr[j]:
                arr[j],arr[i]=arr[i],arr[j]
    return arr

def bubblesort2(arr):
    for i in range(1,len(arr)):
        for j in range(0,len(arr)-i):
            if arr[j]>arr[j+1]:
                arr[j],arr[j+1]=arr[j+1],arr[j]
    return arr

if __name__=="__main__":
    import random

    s = []
    for i in range(10):
        s.append(random.randint(0, 100))
    print(s)
    print(bubblesort(s))
    print(bubblesort2(s))