归并排序(Merge Sort):
归并(Merge)排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列。
示例:
代码实现:
# 时间复杂度O(nlogn)
def merge(left, right):
i, j = 0, 0
result = []
while i < len(left) and j < len(right):
if left[i] <= right[j]:
result.append(left[i])
i += 1
else:
result.append(right[j])
j += 1
result = result + left[i:]
result = result + right[j:]
return result
def merge_sort(lists):
if len(lists) <= 1:
return lists
num = len(lists) // 2
left = merge_sort(lists[:num])
right = merge_sort(lists[num:])
print(merge(left, right))
return merge(left, right)
list1 = [49, 38, 65, 97, 76, 13, 27]
merge_sort(list1)