数据结构之Python实现归并排序merge

"""
归并排序：
"""

def merge_sort(alist):
    """归并排序"""
    n = len(alist)
    if n <= 1:
        return alist
    mid = n // 2

    left_li = merge_sort(alist[:mid])
    right_li = merge_sort(alist[mid:])

    left_pointer, right_pointer = 0, 0
    result = []

    while left_pointer < len(left_li) and right_pointer < len(right_li):
        if left_li[left_pointer] <= right_li[right_pointer]:
            result.append(left_li[left_pointer])
            left_pointer += 1
        else:
            result.append(right_li[right_pointer])
            right_pointer += 1


    result += left_li[left_pointer:]
    result += right_li[right_pointer:]
    return result



if __name__ == '__main__':
    li = [54, 65, 23, 46, 76, 45, 92, 14]
    print(li)
    sorted_li = merge_sort(li)
    print(li)
    print(sorted_li)