Algorithms to Live By: The Computer Science of Human Decisions

by Brian Christian

This is the rosiest class of problems there is: called “Big-O of one,” written O(1), it is also known as “constant time.”