Takeaways

• A greedy algorithm makes local greedy decision to maximize some objective function in hopes that it yields the global optimal solution.
• Greedy algorithms do not always guarantee an optimal solution, and may not always be fair
• Tractability refers to what problem can and cannot be solved efficiently
• P is the set of all problem we can solve in polynomial time. NP is the set of problem that can be verified in polynomial time
• If you provde P=NP, you can win one million dollars.

Code

• April 8th Code