“归并排序”（python）

归并排序就是利用递归和分治技术将数据序列分成为越来越小的半子表，再对半子表排序，最后再用递归步骤将排好序的半子表和并成为越来越大的有序序列。其中“归”代表递归的意思，既递归地将数组折半地分离为单个数组。

def merge(left, right):  # 合并
    i, j = 0, 0
    result = []
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            result.append(left[i])
            i += 1
        else:
            result.append(right[j])
            j += 1

    result += left[i:]
    result += right[j:]
    return result

def merge_sort(lists):
    # 归并排序
    if len(lists) <= 1:
        return lists
    num = len(lists)//2
    left = merge_sort(lists[:num])
    right = merge_sort(lists[num:])
    return merge(left, right)


if __name__ == "__main__":
    lists = [3, 4, 2, 8, 9, 5, 1]
    print("排序前的序列为：")
    for i in lists:
        print(i, end=" ")
    print("\n")
    print("排序后的序列为：")
    for i in merge_sort(lists):
        print(i, end=" ")