Algorithms to Live By: The Computer Science of Human Decisions

by Brian Christian

Faced with, say, an overflowing inbox of n messages, we know from sorting theory that repeatedly scanning it for the most important one to answer next will take O(n2) operations—n scans of n messages apiece.