{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}

{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}

Mergesort

Mergesort

Bubble Sort

Bubble Sort

Insertion Sort

Insertion Sort

Selection Sort

Selection Sort

The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.

The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.

The original list is broken into two groups, then sorted from there.

The original list is broken into two groups, then sorted from there.

The orginal list is broken into sublists of 4, then are combined together.

The orginal list is broken into sublists of 4, then are combined together.

Each element in the list is compared to all the other elements and inserted where it fits.

Each element in the list is compared to all the other elements and inserted where it fits.

If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.

If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.

Mergesort

Mergesort

Bubble Sort

Bubble Sort

Insertion Sort

Insertion Sort

Selection Sort

Selection Sort

The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.

The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.

The original list is broken into two groups, then sorted from there.

The original list is broken into two groups, then sorted from there.

The orginal list is broken into sublists of 4, then are combined together.

The orginal list is broken into sublists of 4, then are combined together.

Each element in the list is compared to all the other elements and inserted where it fits.

Each element in the list is compared to all the other elements and inserted where it fits.

If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.

If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.

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

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