func_code: def sort(a):
      i = 0
      while i < len(a):
          p = i
          i = i + 1
          while i < len(a):
              if a[i] < a[p]:
                  p = i
              i = i + 1
          swap
          i = i + 1