Envío 1403

Código

import sys

def sort(array):
  n = len(array)
  if n == 0:
    return []
  new_element = array[-1]
  previous_elements = sort(array[0:-1])

  # Now insert last element at the right place.
  for at in range(len(previous_elements)-1, -1, -1):
      if previous_elements[at] <= new_element:
        return previous_elements[0:at+1] + [new_element] + previous_elements[at+1:]

  return [new_element] + previous_elements

if __name__ == "__main__":
  sys.setrecursionlimit(2000)
  _ = input()
  sorted = sort([int(x) for x in input().split()])
  print(" ".join([str(x) for x in sorted]))