4.3.5.1 Bubble sort

 To meet this assessment objective you should: 

Know and be able to trace and analyse the time complexity of the bubble sort algorithm.

This is included as an example of a particularly inefficient sorting algorithm, time-wise. Time complexity is O(n2).