LECTURE 5 OF 25
Recursion
A function that trusts a smaller call to itself to solve a smaller version of the same problem — with a base case as the trapdoor that stops the falling.
Builds on
Best read after 1. Big-O Notation, 2. Arrays — you can still read ahead, but some of this may lean on ideas covered there.