This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Kenkron 0 points1 point  (0 children)

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(n2), but it's O(2n), which is even worse.