In several places in the lecture notes, we have included “asides” to the instructor. Which we covered in an optional CS 25 lecture.) (We have included lecture notes for one starred section: 12.4, on randomly built binary search trees, Text-usually starred-are omitted from the lecture notes. Lecture presentation or even omitted certain considerations. In some places, we have simplified the material for You will find that the lecture notes are more informal than the text, as is appropriate for a lecture situation. Some are from Tom Cormen’s lectures in Dartmouth College’s undergraduate Lectures in MIT’s undergraduate algorithms course, 6.046. Some are from the first-edition manual they correspond to Charles Leiserson’s The lecture notes are based on three sources: Moreover, if we add materialįor currently uncovered chapters, the numbers of the existing pages will remain Or change solutions to exercises and problems, the only pages whose numbering isĪffected are those for the solutions for that chapter. We chose this form of page numbering so that if we add The PP numbers restart from 1 at the beginning of eachĬhapter’s lecture notes. Is a chapter number of the text and PP is the page number within that chapter’s We have numbered the pages in this manual using the format CC-PP, where CC Include all solutions, this manual would be much longer than the text itself. To release this manual in as timely a fashion as possible. Writing up all these solutions would take a long time, and we felt it more important Included solutions to all exercises and problems in the selected chapters. Solutions for Chapter 27), as well as Appendices A–D future editions of this manual may include some of these chapters. We have also omitted the chapters that are not covered in theĬourses that we teach: Chapters 18–20 and 27–35 (though we do include some We felt that Chapter 1 is too nontechnical to include here, and Chapter 10 consists of background material that often falls outside algorithms and datastructures courses. Included solutions for every exercise and problem within the chapters that we have We have not included lecture notes and solutions for every chapter, nor have we
You to decide how to best use the material in the manual in your own course. That is, for most chapters we have provided a set of lecture notes and a set ofĮxercise and problem solutions pertaining to the chapter. In Spring 1991-but like the instructor’s manual for the second edition, we haveĬhosen to organize the manual for the third edition according to chapters of the Unlike the instructor’s manual for the first edition of the text-which was organizedĪround the undergraduate algorithms course taught by Charles Leiserson at MIT Some of the material herein to be useful for a CS 2-style course in data structures. It is intended for use in a course on algorithms. This document is an instructor’s manual to accompany Introduction to Algorithms, Solutions to Exercises 24.3-3 and 24.4-7 and Problem 24-1. Solution to Exercise 16.4-3, courtesy of Zhixiang Zhu. Corrected spelling in the solution to Exercise 16.2-4. Added an alternative solution to Exercise 6.3-3, courtesyħ December 2009. Corrected a minor error in the solution to Exercise 4.3-7.ġ6 December 2009. Changed the solutions to Exercises 22.2-3 and 22.3-4 becauseġ7 February 2010. On page 6-9 to assume that the parameter n is passed by reference. Pseudocode for H EAP -E XTRACT-M AX on page 6-8 and M AX -H EAP -I NSERT Parameter to recursive calls of R EC -M AT-M ULT on page 4-7.
Removed unnecessary code in the solution to Problem 2-4(d). Corrected an error in the solution to Problem 2-4(c), and The bodies of all pseudocode procedures are indented slightly.Ģ8 January 2011. Corrected anĮrror in the proof about the Edmonds-Karp algorithm performing O.VE/ flowĪugmentations. Minor error in the Chapter 15 notes in the recurrence for T. To Exercise 2.3-7, courtesy of Viktor Korsun and Crystal Peng. Corrected an error in the solution to Exercise 23.1-6, courtesyģ January 2012. Corrected an error in the solution to Exercise 4.3-7, courtesy Revisions are listed by date rather than being numbered.Ģ2 February 2014. Other electronic storage or transmission, or broadcast for distance learning.Ĭhapter 5: Probabilistic Analysis and Randomized AlgorithmsĬhapter 21: Data Structures for Disjoint Sets Or retrieval system, without the prior written consent of The MIT Press, including, but not limited to, network or No part of this publication may be reproduced or distributed in any form or by any means, or stored in a database Copyright c 2009 by The Massachusetts Institute of Technology. Instructor’s Manual to Accompany Introduction to Algorithms, Third Editionīy Thomas H.