冒泡算法

import random
import time

def bubble_sort(array):
    for i in range(len(array)):
        for j in range(len(array)-1-i,):
            if array[j] > array[j+1]:
                tmp = array[j]
                array[j] = array[j+1]
                array[j+1] = tmp


if __name__ == '__main__':
    array = []
    for i in range(20000):
        array.append(random.randrange(100000))
        
    time_start = time.time()
    bubble_sort(array)
    time_end = time.time()



print (array)
print ("cost:",time_end-time_start)

#冒泡算法：4.35s(5000个数字),17.60（10000个数字），70（20000个数字）