选择排序算法

import random,time
def selection_sort(array):
    for i in range(len(array)):
        smallest_index = i
        for j in range(i,len(array)):
            if array[smallest_index] > array[j]:
                smallest_index = j
        tmp = array[i]
        array[i] = array[smallest_index]
        array[smallest_index] = tmp

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

    time_start = time.time()
    selection_sort(array)
    time_end = time.time()

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


#选择排序：1.65s(5000个数字)6.66s（10000个数字），26s（20000个数字）