Python 归并排序算法代码实现

# -*- coding:utf8 -*-
def merge_sort(items, comp=lambda x, y: x <= y):
    """归并排序(分治法)"""
    if len(items) < 2:
        return items[:]
    mid = len(items) // 2
    left = merge_sort(items[:mid], comp)
    right = merge_sort(items[mid:], comp)
    return merge(left, right, comp)

def merge(items1, items2, comp):
    '''合并（将两个有序的列表合并成一个有序的列表'''
    items = []
    index1, index2 = 0, 0
    while index1 < len(items1) and index2 < len(items2):
        if comp(items1[index1], items2[index2]):
            items.append(items1[index1])
            index1 += 1
        else:
            items.append(items2[index2])
            index2 += 1
    items += items1[index1:]
    items += items2[index2:]
    return items

list_1 = [32,1,3,4,29,10,5]
list_2 = [6,4,3,4,29,10,5]
print(merge_sort(list_1))
# [1, 3, 4, 5, 10, 29, 32]