Insertion sort is a simple and intuitive algorithm but has a worst-case runtime of $\mathcal{O}(n^2)$. However, sometimes it may be preferable to use this algorithm.

Which of the following statements about insertion sort are true?

Select **ALL** that apply.

Select an assignment template