代碼:
# -*- coding: utf-8 -*-
"""歸并排序"""
import random
def merge(left, right):
"""合并兩個數(shù)組"""
merged = []
# i, j 分別作為left和right的下標(biāo)
i, j = 0, 0
left_len, right_len = len(left), len(right)
while i < left_len and j < right_len:
if left[i] <= right[j]:
merged.append(left[i])
i += 1
else:
merged.append(right[j])
j += 1
merged.extend(left[i:])
merged.extend(right[j:])
return merged
def merge_sort(lst):
if len(lst) <= 1:
return lst
middle = len(lst) // 2
left = merge_sort(lst[:middle])
right = merge_sort(lst[middle:])
return merge(left, right)
if __name__ == '__main__':
lst = []
for i in range(30):
lst.append(random.randint(1, 100))
print lst
result = merge_sort(lst)
print result
