Explain why, in the worst case, the number of comparisons is of O(n^2) for the insertion sort.?

1 answer 1