In class 7, we begin our investigation into asymptotic analysis of algorithms.
We will look at bubble sort, insert sort and selection sort as examples.
We introduce and prove some theorems about "Big-O", review proof by induction
and look at some common orders of growth.
Class 7 lecture will be taken from lecture notes available here on the web.
Lecture notes are available in
postscript format and HTML format.