2.1 Bubble sort vs Insertion sort

Compares pairs of items and swaps them if they are in the wrong order. Each pair in the list is checked.

• Bubble sort
• Insertion sort

The process keeps repeating until there are no swaps in a pass.

• Bubble sort
• Insertion sort

Efficient way to check if a list is already in order.

• Bubble sort
• Insertion sort

Inefficient way to sort a list.

• Bubble sort
• Insertion sort

Takes each item in turn and puts it in the right place using the first item in the list as a starting point.

• Bubble sort
• Insertion sort

Starts by looking at the second item and compares it to all items before it in order to insert it in the right place.

• Bubble sort
• Insertion sort

Repeats the process for the rest of the items until the last item has been inserted in the correct place.

• Bubble sort
• Insertion sort

Very quick to add items in an already ordered list

• Bubble sort
• Insertion sort

Good for small lists.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort

Doesn’t use much memory.

• Bubble sort
• Insertion sort
• Bubble sort and insertion sort