python/备战蓝桥杯-归并排序

归并排序

nums = [5,3,6,4,1,2,8,7]
def MergeSort(num):
    if(len(num)<=1):
        return num
    mid = int(len(num) / 2)
    llist, rlist = MergeSort(num[:mid]), MergeSort(num[mid:])
    result =[]
    i,j = 0,0
    while i<len(llist) and j<len(rlist):
        if llist[i]>rlist[j]:
            result.append(rlist[j])
            j += 1
        else:
            result.append(llist[i])
            i += 1
    result += llist[i:]+rlist[j:]
    return result
print(MergeSort(nums))