Dynamic Programming A simple but non-trivial method for designing algorithms Achieve much better efficiency than naive ones. A couple of examples will be exhibited and analyzed. 3Dynamic Programming ◼ A simple but non-trivial method for designing algorithms ◼ Achieve much better efficiency than naïve ones. ◼ A couple of examples will be exhibited and analyzed. 3