{1, 4, 5, 9, 2, 0, 4}

{1, 9, 4, 5, 2, 0, 4}

{1, 4, 9, 5, 2, 0, 4}

{1, 4, 4, 9, 5, 2, 0}

{1, 4, 4, 5, 9, 2, 0}

It removes one element from the list, finds where it should be located, and inserts it in that position until no more elements remain.

All numbers less than the average are inserted on the left, and the rest is inserted at the right. The process is then repeated for the left and right side until all numbers are sorted.

The list is broken apart into smaller lists that are sorted and merged back together.

The list is iterated through multiple times until it finds the desired first number, then repeats the process for all numbers.

None of these are insertion sort.

I, II, III, IV

II, IV

I, II, III

I, II

II, III, IV