Which of the following examples represent the worst case input for an insertion sort?
(a) array in sorted order
(b) array sorted in reverse order
(c) normal unsorted array
(d) large array
The question was posed to me in my homework.
I'd like to ask this question from Insertion sort in chapter Sorting of Data Structures & Algorithms II