Which sorting algorithm performs the worst when the input array is nearly sorted?

Explanation

As per the official answer key, the answer is Insertion Sort. (Note: in theory insertion sort is fast on nearly sorted input, so this key is debatable.)