list1 = [10,8,7,9,6,5,2,4,3,1];
count = len(list1);
def mergeSort(list0, i, j):
if i < j:
k = (int)((i + j) / 2)
mergeSort(list0, i, k)
mergeSort(list0, k + 1, j)
merge(list0, i, k, j)
def merge(list0, i, k, j):
n1 = k - i + 1
n2 = j - k
subList1 = []
subList2 = []
for a in range(0, n1):
subList1.append(list0[i + a])
for a in range(0, n2):
subList2.append(list0[k + 1 + a])
m1 = 0;
m2 = 0;
tmp1 = 0;
tmp2 = 0;
for a in range(i, j + 1):
if m1 < n1:
tmp1 = subList1[m1]
if m2 < n2:
tmp2 = subList2[m2]
if tmp1 > tmp2 and m2 < n2:
list0[a] = tmp2
m2 = m2 + 1
else:
if m1 < n1:
list0[a] = tmp1
m1 = m1 + 1
mergeSort(list1, 0, count - 1);
print(list1);
作者:李印臣,2005年毕业于山东师范大学计算机系,曾三次患有精神分裂症。康复后,做了近四年的软件工程师,然后做了两年精神分裂症领域的公益,现重新回到软件行业,一切从头再开始!
愿这个博客见证我的成长与进步。