Algorithms to Live By: The Computer Science of Human Decisions by Brian Christian & Tom Griffiths
https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...
If the former sounds interesting, here is a similar book I read a long time ago: https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...
It can sound a bit simple at first, but the human - algo stories are terrific.
Edit: why? Because you believe in the leverage algorithms can provide https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...
There are probably a lot of single people here that would benefit from that book as well (the stopping problem)
We all "know" the algos. But reading/hearing how they can be applied and what effect they can have on your life can be enlightening.
Super accessible.
https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...
The article talks about simultaneous choices (choice overload). A related concept is serial choices and the "when to stop looking for The One" dilemma. That's been modeled as The Secretary Problem[1] which calculates a 37% stopping point. It also has been discussed by several authors: [2] [3] [4] [5]
[1]https://en.wikipedia.org/wiki/Secretary_problem
[2]https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...
[3]https://youtu.be/OwKj-wgXteo?t=10m12s
[4]https://www.amazon.com/Mathematics-Love-Patterns-Ultimate-Eq...
[5]https://www.ted.com/talks/hannah_fry_the_mathematics_of_love...
As the article states, caching is useful when you have memory stores with different access speeds. This is (frequently, in my experience, caveat caveat etc.) not the case in reality, where you only have the one storage area that has a fixed, fairly low access speed. People are mostly bottlenecked by scanning rate, so it'd make more sense to use an indexing mechanism. Maybe b-trees for closets? B-trees, perhaps, if you store things in boxes?
https://www.amazon.com/-/es/Brian-Christian/dp/1627790365