3rd Edition. — MIT Press, 2009. — 499 p.
The instructor's guide for the 3rd edition of Thomas Corman's fundamental book on algorithms, "Algorithms. Construction and Analysis" includes solutions to all problems from the book, as well as a brief summary of information on each chapter for easy memorization.
This document is an instructor’s manual to accompany Introduction to Algorithms, Third Edition, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is intended for use in a course on algorithms. You might also find some of the material herein to be useful for a CS 2-style course in data structures.
Unlike the instructor’s manual for the first edition of the text — which was organized around the undergraduate algorithms course taught by Charles Leiserson at MIT in Spring 1991 — but like the instructor’s manual for the second edition, we have chosen to organize the manual for the third edition according to chapters of the text. That is, for most chapters we have provided a set of lecture notes and a set of exercise and problem solutions pertaining to the chapter. This organization allows you to decide how to best use the material in the manual in your own course.