This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Introduction to Algorithms February 13, 2004 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Handout 5 Problem Set 2 This problem set is due in class on Tuesday, February 24 . Reading: Chapters 5.15.3, 7, 9 There are four problems. Each problem is to be done on a separate sheet (or sheets) of paper. Mark the top of each sheet with your name, the course number, the problem number, your recitation section, the date, and the names of any students with whom you collaborated. You will often be called upon to give an algorithm to solve a certain problem. Giving an algorithm entails: 1. A description of the algorithm in English and, if helpful, pseudocode. 2. A proof (or argument) of the correctness of the algorithm. 3. An analysis of the running time of the algorithm. It is also suggested that you include at least one worked example or diagram to show more precisely how your algorithm works. Remember, your goal is to communicate. Graders will be instructed to take off points for convoluted and obtuse descriptions. If you cannot solve a problem, give a brief summary of any partial results.give a brief summary of any partial results....
View
Full
Document
 Spring '04
 ErikDemaine
 Algorithms

Click to edit the document details