Envío 1518

Código

def mergesort(a):
    if len(a) < 2:
        return a

    middle = len(a) // 2

    left = mergesort(a[0:middle])
    right = mergesort(a[middle:])
 
    if left[-1] <= right[0]:
        left.extend(right)
        return left

    merged = merge(left, right)
    return merged

def merge(left, right):
    result = []
    while (len(left)>0 and len(right)>0):
        if left[0] <= right[0]:
            result.append(left[0])
            left = left[1:]
        else:
            result.append(right[0])
            right = right[1:]
    if(len(left)>0):
        result.extend(left)
    if(len(right)>0):
        result.extend(right)
    return result

n = int(input())
input = input().split(' ')
array = list(map(int, input))

result = mergesort(array)
for i in result:
    print(i, end = ' ')