2.1 Algorithms

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

• Bubble sort
• Insertion sort
• Merge sort
• Linear search
• Binary search

Good for small lists.

• Bubble sort
• Insertion sort
• Merge sort
• Bubble sort and insertion sort
• Merge sort and bubble sort

Doesn’t use much memory.

• Bubble sort
• Insertion sort
• Merge sort
• Bubble sort and insertion sort
• Merge sort and bubble sort

Very quick to add items in an already ordered list

• Bubble sort
• Insertion sort
• Merge sort
• Linear search
• Binary search

Speed of sort depends on how unordered the list is.

• Bubble sort
• Insertion sort
• Merge sort
• Bubble sort and insertion sort
• Merge sort and bubble sort

Does not cope well with very large lists.

• Bubble sort
• Insertion sort
• Merge sort
• Bubble sort and insertion sort
• Merge sort and bubble 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
• Merge sort
• Linear search
• Binary search

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

• Bubble sort
• Insertion sort
• Merge sort
• Linear search
• Binary search

Could be a quick way to check if a small list is already in order.

• Bubble sort

• Insertion sort

• Merge sort

• Linear search

• Binary search

The most inefficient way to sort a list.

• Bubble sort

• Insertion sort

• Merge sort

• Linear search

• Binary search