Friday, May 26, 2017

Greedy Choice Versus Dynamic Programing

To give a mini lecture on when one can use a greedy algorithm and when one must resort to dynamic programming, I had a little cross disciplinary breakthrough: we can make the greedy choice (and thus use a greedy algorithm) when there is no opportunity cost for doing so. When are choice does come with opportunity costs, the greedy choice won't work.

I hope to post the lecture later.

No comments:

Post a Comment

Zeno for the computer age

If you wish to better understand Zeno's worry about the continuum, you could do worse than to consider loops in software. Case 1: You...