func_code: def swap(a, i, j):
      temp = a[i]
      a[i] = a[j]
      a[j] = temp
  
  
  def find_position_of_smallest(a, i):
      p = i
      while i < len(a):
          if a[i] < a[p]:
              p = i
          i = i + 1
      return p
  
  
  def sort(a):
      while i < len(a):
          if find_position_of_smallest(a, i).swap(a):
              swap(a, i, j).sort(a)
      i = i + 1