Algorithms to Live By: What Computer Science Knows About Your Life That You Don’t

Here’s the pitch of this book in one line: the problems you wrestle with every day β€” when to stop apartment hunting, what to throw away, how to plan a schedule that keeps falling apart β€” are problems computer scientists solved decades ago. Not for humans. For machines. But the maths doesn’t care which one is asking.

Brian Christian, working with cognitive scientist Tom Griffiths, went looking for the overlap between computer science and human life, and found it’s much bigger than anyone expected. Sorting algorithms explain how to organise your kitchen. Caching explains what to keep on your desk. A problem called “optimal stopping” explains dating, hiring, and house hunting all at once. This isn’t a productivity book dressed up in science words. It is a translation of actual math into algorithms to live by with practical examples you can apply to decisions you are making this week.

algorithms to live

Brian Christian, working with cognitive scientist Tom Griffiths, went looking for the overlap between computer science and human life, and found it’s much bigger than anyone expected. Sorting algorithms explain how to organise your kitchen. Caching explains what to keep on your desk. A problem called “optimal stopping” explains dating, hiring, and house hunting all at once.

πŸ” The 37% Rule: when to stop looking and choose

This is the single most quoted idea from the book, and it earns the reputation.

The setup, in computer science, is called the “secretary problem”: you’re interviewing candidates one at a time, you must decide to accept or reject each one on the spot, and you can never go back to someone you rejected. How do you maximise your odds of picking the best one?

If you want to geek out on the actual math behind it, you can read the original definition on Wikipedia’s Secretary Problem page.

The proven answer: spend the first 37% of your search purely looking β€” reject everyone, no matter how good β€” then commit to the first candidate afterward who beats everyone you’ve seen so far.

That number isn’t a rough guess. It’s the mathematically optimal stopping point. It gives you roughly a 37% chance of landing the actual best option β€” which sounds unimpressive until you realise that’s the best any strategy can do under those rules.

This maps almost perfectly onto real decisions:

  • House hunting β€” if you’ve budgeted to see 20 homes, spend the first 7 purely calibrating. Don’t buy. Just learn what “good” looks like in your market. From house 8 onward, buy the first one that beats everything you’ve seen.
  • Hiring β€” interview the first 37% of your candidate pool without making an offer. After that, offer the job to the first person who’s better than everyone before them.
  • A parking search β€” this is the one that makes it click for people. Circling forever hoping for the perfect spot loses. Committing to the first one after your “calibration” pass wins, on average.

You’re not trying to guarantee the best outcome. You’re trying to stop losing to indecision.

The deeper comfort here: regret over “did I look enough” and regret over “did I settle too fast” are both irrational once you know the math. There’s a correct amount of looking, and it’s less than your anxiety tells you.

πŸ—‘οΈWhen Over-Sorting Costs More Than Mess: Algorithms to Live By Practical Examples

Computer scientists obsess over sorting because it’s genuinely costly, computationally speaking. And Christian’s insight is that we over-sort our physical lives for the exact same reason it’s expensive for a computer: most of what you sort, you never look for again.

Your bookshelf doesn’t need to be alphabetised if you rarely search it by author. Your filing cabinet doesn’t need a perfect system if you retrieve five documents a year from it.

The computer science answer to “should I organise this?” isn’t “yes, always.” It’s a real trade-off: Sorting cost vs. searching cost.

If you’ll search something constantly, sort it once, thoroughly. If you’ll search it rarely, don’t bother β€” a quick scan through mess is cheaper than the hours spent maintaining order nobody uses.

This alone is permission to stop feeling guilty about the messy drawer. Some mess is computationally correct.

If you’re struggling to let go of perfectionism in your home organisation, check out our previous post on [Why Productivity Isn’t About Perfection] (Internal Link Placeholder).

πŸ“₯ Caching: keep what you touch, drop what you don’t

Related idea, and one of the most immediately useful in the whole book.

Computers use “caching” β€” keeping recently and frequently used data somewhere fast to reach, and pushing rarely used data somewhere slower and out of the way. Not because the rare stuff doesn’t matter. Because retrieval speed should match how often you’ll need it.

Apply this literally to your physical space:

  • Things you use daily β†’ the most accessible spot in the house (eye level, front of the drawer, top of the pile)
  • Things you use monthly β†’ one step further away
  • Things you use once a year β†’ the back, the top shelf, storage

Most people organise by category (all the pens together, all the cables together) instead of by frequency of use. Christian’s point is that frequency should win. A rarely used “important” document can live further away than a daily-used trivial one β€” access speed should track usage, not sentimental importance.

This is also, quietly, the best argument for a capsule wardrobe you’ll ever read in a computer science book: the clothes you actually wear belong in the fastest-access spot. Everything else is cache eviction waiting to happen.

βš–οΈ Explore vs. Exploit: the tension behind every choice

This is the idea I think about the most, months after reading it.

Every time you choose, you’re balancing two competing instincts:

  • Exploration β€” trying something new, gathering information, risking a worse outcome for the chance of discovering a better one.
  • Exploitation β€” going with what you already know works, cashing in on a sure thing.

Computer science has a precise answer for when to favour which, and it comes down to one variable: how much time do you have left?

To understand why this balance is crucial for long-term happiness, we recommend reading The Psychology of Money: A Masterclass in Perspective.

Early on β€” lots of time horizon remaining β€” exploration wins. Try the new restaurant. Take the unfamiliar project. The potential upside of discovering something great has a long runway to pay off.

Later β€” less time horizon remaining β€” exploitation wins. Go back to what you know is good. There’s less time left to benefit from a discovery, so the sure thing becomes more valuable than the gamble.

This explains something that used to look like a personality flaw and is actually optimal behaviour: why older people order the same dish at the same restaurant, and why younger people are more willing to try the weird new place. It’s not closed-mindedness. It’s correct math for a shorter remaining horizon.

It also reframes career and life decisions. A season of trying many things isn’t indecision β€” it’s the right strategy for a long horizon. And narrowing down later isn’t giving up β€” it’s cashing in on what exploring already taught you.

If you’re early in a horizon, explore harder than feels comfortable. If you’re near the end of one, stop second-guessing the thing you already know works.

🧠 A few more tools worth stealing

The book covers a lot more ground than these three headline ideas. To see what else author Brian Christian is up to, check out his personal site: Brian Christian Official.

Quick hits worth knowing:

  • Relaxation. When a problem is too hard to solve exactly, computer scientists solve an easier, “relaxed” version of it first, and use that as a guide. Translation for real life: if a decision feels paralysing, solve a simplified version of it first (ignore one constraint) β€” the answer often points you the right direction even before you tackle the real thing.
  • Scheduling. The book’s take on to-do lists is refreshingly unsentimental: when you have more urgent tasks than time, doing the single most urgent one first β€” even if a longer task is looming β€” usually beats trying to be clever about it.
  • Overfitting. In machine learning, a model that’s too closely tuned to old data performs worse on new situations. Human version: a life plan built entirely around exactly replaying your past experience will fail to generalise to the future. Some looseness in your plans is a feature, not sloppiness.

βœ… This week’s checklist

  1. Pick one decision you’re currently stuck circling on (a purchase, a hire, an apartment). Calculate your 37% point and commit to the rule.
  2. Look at one messy space in your home and ask honestly: do I search this often enough to justify sorting it? If not, let it go.
  3. Reorganise one drawer or shelf by frequency of use, not category.
  4. Name one area of your life where you’re still exploring versus one where you should be exploiting what you already know works β€” and check whether you’re doing it backwards.

The quiet gift of this book is permission. Permission to stop searching once you’ve looked enough. Permission to leave the drawer messy. Permission to keep ordering the same dish. Computer scientists spent decades proving, with hard math, that the sensible-feeling shortcut is very often the mathematically correct one.

You were probably closer to right than you thought.

πŸ’¬ Over to you: Where in your life have you been “searching” way past the 37% mark? Tell me below β€” I’ll help you figure out where your stopping point actually is.

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top