Give an example of a worst-case sequence with n elements for insertion-sort, and show that insertion-sort runs in(n2) time on such a sequence.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.