Lecture #01: This Course
Lecture #02: Revision
Lecture #03: Running Time
Lecture #04: Estimating Running Time
Lecture #05: Asymptotic Notation
Lecture #06: More on Algorithm Analysis
Lecture #07: Sorting, Selection Sort
Lecture #08: Insertion Sort
Lecture #09: Merge Sort
Lecture #10: Recurrence Relations [TODO]
Lecture #11: Quick Sort [TODO]
Lecture #12: Lower Bound for Sorting
Lecture #13: Heapsort
Lecture #14: Priority Queues
Lecture #15: Binary Trees
Lecture #16: Binary Search Trees
Lecture #17: Hashing
Lecture #19: Perfect Hashing
Lecture #20: Graphs
Lecture #21: Graphs Cont.