Visit http://www.catonmat.net for transcription of this lecture and lecture notes. Lecture 2: Asymptotic notation. Big omega notation. Theta notation. Small o notation. Small omega notation. From the page:
Solving recurrences. Substitution method. Recursion tree method. The master method. Ps. MIT OCW lectures are released under CC license, so I had all the legal rights to upload them to Google Video. For more information visit: http://ocw.mit.edu/OcwWeb/web/terms/terms/index.htm
A lecture on algorithms at MIT by Charles E. Leiserson.
From the sidebar:
Visit http://www.catonmat.net for transcription of this lecture and lecture notes. Lecture 1: Analysis of algorithms. Sorting. Insertion sort. Running time of insertion sort. Kinds of running time analysis. Asymptotic analysis. Merge sort. Recurrence for merge sort. Recursion tree. Ps. MIT OCW lectures are released under CC license, so I had all the legal rights to upload them to Google Video. For more information visit: http://ocw.mit.edu/OcwWeb/web/terms/terms/index.htm