Python 归并排序

def merge(arr):
    if len(arr) == 1:
        return arr
    length = len(arr)
    arr1 = merge(arr[0 : length // 2])
    arr2 = merge(arr[length // 2 : length])
    temp = []
    index1 = 0
    index2 = 0
    while index1 < len(arr1) and index2 < len(arr2):
        if arr1[index1] > arr2[index2]:
            temp.append(arr2[index2])
            index2 += 1
        else:
            temp.append(arr1[index1])
            index1 += 1
    if index1 < len(arr1):
        for i in range(index1, len(arr1)):
            temp.append(arr1[i])
    else:
        for i in range(index2, len(arr2)):
            temp.append(arr2[i])
    return temp
    

arr = [8, 4, 5, 7, 1, 3, 6, 2]
arr = merge(arr)
print(arr)

arr = [8, 4, 5, 7, 1, 3, 6, 2, 9]
arr = merge(arr)
print(arr)