The following slides provided by the author of the textbook (with some
extensions and updates by Prof. Jiang) will be used in class:
Introduction to algorithms and review of data structures
Asymptotic notations and analysis of algorithms
Morr recurrence relations and analysis of recursive algorithms (from CLRS)
Bruce force algorithms
The divide-and-conquer method
Decrease-and-conquer algorithms
Transform-and-conquer algorithms
Dynamic programming
Greedy and graph algorithms
Space-and-time tradeoffs and string matching
More on string matching, the KMP algorithm (from CLRS)
Lower bound for sorting
You may find a short tutorial on recurrence
relations and
a tutorial
on C++ programming style useful.