KAIST 산업및시스템공학과 문일철_ 데이터 구조 및 분석 수업을 참고하여 작성하였습니다

ch_4_3 Dynamic Programming 1 (Memoization)

Dynamic Programming 1 (Memoization)

1. Dynamic Programming 1 (Memoization)
    : A general algorithm for solving problem
        (as recurrences with overlapping sub-instance)
    : Probramming == Planning
    : Main storyline
        - solve small instances once
        - record solutions in a table

2. Menoization
    : Key technique of dynamic programming
        - Simply put (storing the results of previous
            function calls to resue the result again)
        - More philosophical sense
            - Bottom-up approach for problem-solving
            - bottom : Recursion (top down)
            - up : Dynamic Programming (bottom up)