We talked about how to classify running-time functions by their asymptotic growth. We also discussed how to express a function in its simplest form.
These are tools that are invaluable for analyzing all sorts of algorithms.
Today we'll connect asymptotic growth to another important tool: recurrence relations. First, some more context.
