recitation16 - MIT OpenCourseWare http/ 6.006...

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

View Full Document Right Arrow Icon
MIT OpenCourseWare 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: .
Background image of page 1

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

View Full DocumentRight Arrow Icon
Recitation 1 6 Notes Dynamic These notes are supposed to be complementary to the lecture notes. Everything that we covered in section is contained either here or there. Programming Ou 1. 2. tline Introduction to Dynamic Programming Memoization: computing Fibonacci numbers Good news: Dynamic Programming (DP) is used heavily in optimization problems. I Applications range from financial models and operations research to biology and ntroduction to Dynamic Programming basic algorithm research. So understanding DP is profitable. Bad news: DP is not with algorithms that you can memorize. an algorithm or a data structure. You don’t get to walk away DP takes advantage of the A problem has an optimal sub optimal sub-structure O contains optimum answers to smaller sub ptimal sub‐structure of a problem.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.

Page1 / 4

recitation16 - MIT OpenCourseWare http/ 6.006...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online