def insertionSort(lst): k = 1 while k < len(lst): x = lst.pop(k) insertInOrder(lst, k, x) k += 1 The above function insertionSort sorts (arranges the elements of) lst in ascending order, using the Insertion Sort algorithm. It relies on the function insertInOrder , which assumes that the first k elements of lst are already sorted and inserts x in the appropriate place among them: def insertInOrder(lst, k, x): while k >= 1 and lst[k-1] > x: k -= 1 lst.insert(k, x) Write a recursive version of insertionSort. Your function shouldnt have any loops. def insertionSort(lst, n=len(lst)):