1. The problem statement, all variables and given/known data How many comparisons does the insertion sort use to sort the list n, n-1, ......2, 1? 2. Relevant equations 3. The attempt at a solution Insertion sort compares every element with every other element in the list, but I'm unsure what this question is asking. Why does it jump from n, n-1 to 2, 1? Thanks for any suggestions.