In the sub-module on algorithms, we saw that in order to specify an algorithm, we needed

We can use these constructs to determine the time-complexity of an algorithm by using the following rules:

Watich the videos "Time complexity analysis - How to calculate running time?" and "Time complexity analysis - some general rules" at  http://www.youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn for more details and some examples.  As before, you will have to watch some adverts.  Also, the video "Time complexity analysis - some general rules" mentions asymptotic notations and in particular theta.  You can understand the material without knowing additional details about these concepts, but if you are interested watch the video "Time complexity analysis: asymptotic notations - big oh, theta ,omega" at the same site.