August 2026
Intermediate
138 pages
2h 57m
English

Imagine that you have 30 minutes to spare before an important meeting and many relevant, unread emails of various lengths and degrees of importance. Picking the emails by highest degree-of-importance / length is a rational way to quickly decide on your order of reading because you will read the lines with the highest value density first and you won’t waste time backtracking. It is not necessarily optimal, however.
This chapter addresses problems that can be solved by building a solution one part at a time. We specify such problems precisely, along with the algorithm outline that solves them. Unlike dynamic programming, ...
Read now
Unlock full access