Envío 2383

Código

def merge(arr, left, right):
    
    arr_ptr = 0
    left_ptr = 0
    right_ptr = 0

    while left_ptr < len(left) and right_ptr < len(right):

        if(left[left_ptr] < right[right_ptr]):
    
            arr[arr_ptr] = left[left_ptr]
            left_ptr += 1

        elif (right[right_ptr] <= left[left_ptr]):
    
            arr[arr_ptr] = right[right_ptr]
            right_ptr += 1
    
        arr_ptr += 1


    while left_ptr < len(left):
        arr[arr_ptr] = left[left_ptr]
        left_ptr += 1
        arr_ptr += 1

    while right_ptr < len(right):
        arr[arr_ptr] = right[right_ptr]
        right_ptr += 1
        arr_ptr += 1

def sort(arr):

    left = 0
    right = len(arr)


    if len(arr) <= 1:

        return arr
    
    mid = (left + right) // 2

    left_arr = arr[left:mid]
    right_arr = arr[mid:right]

    sort(left_arr)
    sort(right_arr)
    merge(arr, left_arr, right_arr)

n = int(input())
items = [int(i) for i in input().split(" ")]

sort(items)

print(" ".join([str(i) for i in items]))

"""
  0 1 2   3 4 5
  1 2 3 | 4 5 6
  L   R | L   R

  left: 0, right: 6, mid: 3
    left: 0, right: 3, mid: 1
        left: 0, right: 1 
        left: 2, right: 3
    left: 4, right: 6, mid: 5
        left: 4, right: 5, mid 4
        left: 6, right: 6, mid: 6

"""