小编Est*_*n D的帖子

我正在尝试实现一个递归合并排序算法,只有函数返回什么,但我很难让它工作.似乎它正在分解列表并正确地对它们进行排序,但是没有将这些已排序的列表转移到下一个递归调用中.

def merge(list1, list2):
    result = []
    i = 0
    j = 0
    k = 0
    while i < len(list1) and j < len(list2):
        if list1[i] < list2[j]:
            result.append(list1[i])
            i+=1
        else:
            result.append(list2[j])
            j+=1                
        k+=1
    while i < len(list1):
        result.append(list1[i])
        i+=1
        k+=1
    while j < len(list2):
        result.append(list2[j])
        j+=1
        k+=1
    print(result)


def merge_sort(inplist):
    if int(len(inplist)) >1:
        mid = len(inplist)//2
        left = inplist[0:mid]
        right = inplist[mid:]
        merge_sort(left)
        merge_sort(right)
        merge(left,right)


test = [1,4,7,2,6,9,8,5,3,0]
merge_sort(test)
print(test)