冒泡算法和排序算法运行速度比较

#-*- encoding= utf-8 -*-
from random import randint
import  datetime

s=[]

for i in range(0,10000):
    s.append(randint(1,10000))

#排序算法
def sort_list(list):
    for i in range(len(list)-1):
        index = i
        for j in range(i + 1, len(list)):
            if list[index] > list[j]:
                index = j
        list[i], list[index] = list[index], list[i]

#冒泡算法       
def bubble_sort(list):
    for i in range(len(list)-1):
        for j in range(len(list)-1-i):
            if list[j]>list[j+1]:
                list[j],list[j+1]=list[j+1],list[j]


starttime=datetime.datetime.now()
sort_list(s)
endtime=datetime.datetime.now()
print  (endtime-starttime).seconds

print s