ss = [464,1564,8234,8564532156,45414654,5154,5,1544,21,32,45,12,15,1657,84,132,489,75,4,8967,654,6587,8,4,21,54,8,12,15,4,21,65]
def sort_ex(a, b):
z = []
i = 0
j = 0
while i < len(a) and j < len(b):
if a[i] < b[j]:
z += [a[i]]
i += 1
else:
z += [b[j]]
j += 1
if i >= j:
z += b[j:]
else:
z += a[i:]
return z;
pass
def sort(x):
if len(x) == 1:
return x;
else:
f = int(len(x)/2)
m = sort(x[0:f])
n = sort(x[f:])
# print(f,m,n)
return sort_ex(m,n)
pass
print(len(ss),sort(ss))
归并法:0.2(可能比这个低)
插入法,16.6s
冒泡,23.1s
选择排序,7.6s
其他不想测试了