import random


def sort_merge(lst):
    """归并排序"""
    if len(lst) < 2:
        return lst
    mid = len(lst) // 2
    left = sort_merge(lst[:mid])
    right = sort_merge(lst[mid:])

    i = j = 0
    lst2 = []
    while i < len(left) and j < len(right):
        if left[i] < right[j]:
            lst2.append(left[i])
            i += 1
        else:
            lst2.append(right[j])
            j += 1

    while i < len(left):
        lst2.append(left[i])
        i += 1

    while j < len(right):
        lst2.append(right[j])
        j += 1

    return lst2


lst = [random.randint(0, 10) for i in range(10)]
print(lst)
lst2 = sort_merge(lst)
print(lst2)