A Journey Through the World of Algorithms

An end-to-end tour of how computer scientists think about algorithms — from what 'efficient' actually means, through Big-O notation, to the five design techniques (Divide & Conquer, Transform & Conquer, Dynamic Programming, Greedy, Brute Force) that cover almost every algorithm you'll meet.