Algorithms to live by

• Rating: 4/5

---

Key takeaways §

• Some problems from computer science can be effectively applied to other situations
  • The 37% rule from Optimal stopping
  • Least Recently Used is a useful rule of thumb for caches
• Some problems are naturally hard and don’t have straightforward solutions, for example many Scheduling situations.
• Strive for Computational kindness, i.e. reducing the computational burden on others

Knowing that you are using an optimal algorithm should be a relief even if you don’t get the results you were looking for.

Chapters §

1. The first chapter deals with Optimal stopping problems.
2. The second chapter is about the Explore Exploit trade-off
3. The third chapter deals with Sorting problems
4. The fourth chapter is about Caching
5. The fifth chapter is about Scheduling
6. The sixth chapter is about Baye’s Rule
7. The seventh chapter is about Overfitting
8. The eighth chapter is about Relaxation
9. The ninth chapter is about Randomness
10. The tenth chapter is about Networking
11. The eleventh chapter is about Game theory