Explanations, pseudocode, an embedded interactive visualization, implementations in JavaScript, Python, Java and Go, complexity and interview variations.
Base case + recursive case; how the call stack grows and unwinds.
n! = n × (n−1)!, the classic first recursive function.
Naive recursion recomputes subproblems — exponential time.
Move n−1 disks aside, move the largest, move n−1 back on top.
Include / exclude each element to generate the power set.
Choose, recurse, un-choose to list every ordering.
Place queens row by row, backtracking on conflicts.
Fill empty cells with valid digits, undo on dead ends.