For syllabus, please see the file attached below.
Lecture 1 (04-July-2011): Insertion sort; exact step counting analysis; idea of loop invariant
Lecture 2 (06-July-2011): Order of growth; O notation, Big-Theta notation , Big-Omega notation; Properties
Lecture 3 (11-July-2011): Divide-and-Conquer algorithm design strategy; MERGETSORT; QUICKSORT
Lecture 4 (13-July-2011): Techniques for solving recurrence equations
Lecture 5 (18-July-2011): Order statistic; Strassen's matrix multiplication