- #1
nicnicman
- 136
- 0
Homework Statement
How many comparisons does the insertion sort use to sort the list n, n-1, ...2, 1?
Homework Equations
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.