Complexity of the algorithms All the previous algorithms have time complexity (number of steps of computation) O(n 2 ) where n is the number of numbers to sort -- See next slide for an example Better (faster) algorithms.