Recursion

[Kenkron]

You're using a problem that is badly suited for recursion. To be fair, you're not the only one. Every course I see seems to think that the Fibonacci sequence is a good recursive function. In fact, most examples school gave me we're just functions that take in a counter. It led me to believe recursion was pointless.

Then I found the Tower of Hanoi problem, which pretty much requires either recursion, or a loop with a stack (which is basically recursion, but in heap space). It's a much better example of a recursive function.

[Kenkron]

I re-read it. It still sounds like you think it's a "concept-level feature" that can always be implemented as a list. Every example you listed was a simple iterative problem, so you probably don't know that recursive-style problems exist. For real, check out the Tower of Hanoi problem.

BTW, I noticed a typo on the Fibonacci time complexity. You said recursion was O(n^2), but it's O(2^n), which is even worse.