Assess students' ability to analyze time–space trade-offs in algorithm design by comparing in-place vs out-of-place implementations, recursion vs iteration (including call-stack and loop overhead), and the effects of memoization on time and space complexity. Provide code snippets to evaluate, require asymptotic estimates and concrete memory reasoning, and ask for justified design recommendations given specific performance and memory constraints.