mit 计算机科学及编程导论（10）

words:

knapsack , crap , polymorphic , coercion ,  propagate , conquer

notes:

1.  divide & conquer algorithm:

    a .  split the problem into several subproblems  of the same type 

    b .  solve the subproblems independently

    c .  combine solutions

2.  what is good divide & conquer algorithm: (no certain answers , u must think about it)

   a . how much division do we want to have 

   b . what is the base case 

   c . how do i combine 

   conclusion : a good divide & conquer algorithm is easy to divide and easy to combine 

3.  algorithm we have learned :  brute force ,  guess and check ,  successive approximation  ,  divide & conquer

4. exceptions