{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ps9 - Introduction to Algorithms Massachusetts Institute of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Introduction to Algorithms December 5, 2005 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik D. Demaine and Charles E. Leiserson Handout 30 Problem Set 9 MIT students: This problem set is due in lecture on Friday, December 9, 2005. The homework lab for this problem set will be held 6–8 P . M . on Thursday, December 8, 2005 . Reading: Chapter 27 and Handout 29. Both exercises and problems should be solved, but only the problems should be turned in. Exercises are intended to help you master the course material. Even though you should not turn in the exercise solutions, you are responsible for material covered in the exercises. 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. Please staple and turn in your solutions on 3-hole punched paper . You will often be called upon to “give an algorithm” to solve a certain problem. Your write-up should take the form of a short essay. A topic paragraph should summarize the problem you are
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.
  • Fall '05
  • ErikD.DemaineandCharlesE.Leiserson
  • CLRS, Merge algorithm, Thomas H. Cormen, Introduction to Algorithms, Charles E. Leiserson

{[ snackBarMessage ]}