2.1 Sorting Algorithms

Describe how a 'bubble sort' works

• Starts at the beginning of the list and compares with the next value, if this is larger a swap is made. Then moves onto the second value and repeats the process.

• The list is repeatedly divided into two until all the elements are separated individually. Pairs of elements are then compared, placed into order and combined. The process is then repeated.

• Compares values in turn, starting with the second value in the list. If this value is greater than the value to the left of it, no changes are made. Otherwise this value is repeatedly moved left until it meets a value that is less than it.

Describe how an 'insertion sort' works

• Starts at the beginning of the list and compares with the next value, if this is larger a swap is made. Then moves onto the second value and repeats the process.

• The list is repeatedly divided into two until all the elements are separated individually. Pairs of elements are then compared, placed into order and combined. The process is then repeated.

• Compares values in turn, starting with the second value in the list. If this value is greater than the value to the left of it, no changes are made. Otherwise this value is repeatedly moved left until it meets a value that is less than it.

Describe how a 'merge sort' works

• Starts at the beginning of the list and compares with the next value, if this is larger a swap is made. Then moves onto the second value and repeats the process.

• The list is repeatedly divided into two until all the elements are separated individually. Pairs of elements are then compared, placed into order and combined. The process is then repeated.

• Compares values in turn, starting with the second value in the list. If this value is greater than the value to the left of it, no changes are made. Otherwise this value is repeatedly moved left until it meets a value that is less than it.

Describe an advantage of a 'bubble sort' algorithm

• Simpler to code than a merge sort

• Easiest to program

• Faster than bubble and insertion sorts.

Describe an advantage of an 'insertion sort' algorithm

• Faster than a bubble sort

• Easiest to program

• Faster than a bubble and insertion sort

Describe an advantage of a 'bubble sort' algorithm

• Simpler to code than a merge sort

• Easiest to program

• Faster than bubble and insertion sorts.

Describe a disadvantage of a 'bubble sort' algorithm

• One of the slowest ways to sort a list

• More complicated to code than bubble and insertion.

• Slower than a merge over large data sets.

Describe a disadvantage of an 'insertion sort' algorithm

• One of the slowest ways to sort a list

• More complicated to code than bubble and insertion.

• Slower than a merge over large data sets.

Describe a disadvantage of a 'merge sort' algorithm

• One of the slowest ways to sort a list

• More complicated to code than bubble and insertion.

• Slower than a merge over large data sets.

Identify two types of searching algorithm

• Bubble and Merge

• Linear and Binary

• Iggle Piggle and Upsy Daisy

• Burgers and Fries