Checkpoint: moves and plan

moves is the exam's favorite recurrence (2·f(n−1)+1 → 2ⁿ−1); plan is the print-order trap: printing BEFORE the recursive call yields ascending order, printing AFTER yields descending. Students who can produce both on demand — one arithmetic, one structural — own the two halves of every recursion question the exam asks.