func_code: def selectionsort(n):
      i = 0
      while i < len(n):
          position = i
          j = i + 1
          while j < len(n):
              if n[j] < n[position]:
                  position = j
              j = j + 1
          val = n[position]
          n[position] = n[i]
          n[i] = val
          i = i + 1