What does the pseudocode for the Insertion Sort algorithm mean and what is the recursive version?

Insertion Sort (datatype A[], int n) { //Input array is A[0: n 1] for i = 1ton-1 l/ Insert A[i]. Everything to the left of A[i] is already sorted. while ( >0 and AU]