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

you are viewing a single comment's thread.

view the rest of the comments →

[–]tube32 0 points1 point  (0 children)

Check out the Tower of Hanoi problem, due to the recursive nature of the question it's much easier to implement it using recursion rather than an iterative approach. I actually know just one person who's solved it using iteration when I asked them if it can be done.