以下是测试代码，插入排序前后结果分别为14.3S、8.7s

选择排序前后结果均为6S左右

import functools, random, time

list = [random.random() for i in range(1,10000)]

def timer(func):
    @functools.wraps(func)
    def wrapper(*args, **kw):
        t0 = time.time()
        result = func(*args, **kw)
        t1 = time.time()
        print('Total running time %s : %s'
            %(func.__name__, str(t1 - t0))
            )
        return func(*args, **kw)
    return wrapper

@timer
def insert_sort(L):
    for i in range(1, len(L)):
        key = L[i]
        j = i - 1
        while j >= 0:
            if L[j] > key:
                L[j + 1],L[j] = L[j],key
            j -= 1
    return L

@timer    
def select_sort(lists):
    count = len(lists)
    for i in range(0, count):
        min = i
        for j in range(i + 1, count):
            if lists[min] > lists[j]:
                min = j
        lists[min], lists[i] = lists[i], lists[min]
    return lists

@timer
def my_sort(lists):
    return sorted(lists)

my_sort(list)
insert_sort(list)
select_sort(list)
insert_sort(list)
select_sort(list)