func_code: def swap(a, i, j):
      a[i], a[j] = a[j], a[i]
  
  
  def find_position_of_smallest(a, i):
      l = a[i:]
      s = 0
      j = 0
      while j < len(l):
          if l[j] < l[s]:
              s = j
          j += 1
      return s + len(a) - len(l)
  
  
  def sort(a):
      i = 0
      while i < len(a):
          smallest = find_position_of_smallest(a, i)
          swap(a, i, smallest)
          i += 1