func_code: def sort(a):
      i = 0
      while i < len(a):
          j = i
          k = i + 1
      while k < len(a):
          if a[k] < a[j]:
              j = k
              k = k + 1
          tmp = a[p]
          a[p] = a[i]
          a[i] = tmp
      i = i + 1
      return k