Envío 1516

Código

def merge_sort(list_):
  size = len(list_)
  if size > 1:
    left_list = list_[:(size // 2)]
    right_list = list_[(size // 2):]

    merge_sort(left_list)
    merge_sort(right_list)

    l = 0
    r = 0
    i = 0

    left_list_size = len(left_list)
    right_list_size = len(right_list)
    while l < left_list_size and r < right_list_size:
      if left_list[l] < right_list[r]:
        list_[i] = left_list[l]
        l = l + 1
      else:
        list_[i] = right_list[r]
        r = r + 1
      i = i + 1

    while l < left_list_size:
      list_[i] = left_list[l]
      l = l + 1
      i = i + 1

    while r < right_list_size:
      list_[i] = right_list[r]
      r = r + 1
      i = i + 1

n = int(input())
arr = [int(x) for x in input().split(" ")]
merge_sort(arr)
for i in arr:
  print(i, end = " ")