func_code: def recursive_selectionsort(A, i):
      if i >= len(A) - 1:
          return
      else:
          p = i
          j = i + 1
          while j < len(A):
              if A[j] < A[p]:
                  p = j
              j = j + 1
          tmp = A[p]
          A[p] = A[i]
          A[i] = tmp
          recursive_selectionsort(A, i + 1)
  
  
  def selectionsort(A):
      recursive_selectionsort(A, 0)