Quiz — Elementary Sorting

Which of these are true of insertion sort? Select all that apply.

It is stable

It sorts in place

On nearly sorted input it runs in close to linear time

Its worst case is O(n log n)

It makes the same number of comparisons on every input of a given size