News for hackers. Stuff that matters.
Re:I'm graduating with a CS degree but I don't feel like I k... by bad_user on Friday February 04, 2011 @12:50PM (#2180340)
Actually recursion in CS is equivalent to using a stack that keeps intermediate values and that grows in relation to the input.

If you've got an algorithm that does that, then it cannot be called "iterative".

I.e. backtracking is recursive, no matter how you implement it.

In school textbooks they do differentiate between "recursive" and "iterative" backtracking, to teach you how to get rid of the call-stack and manage your own. But that's another story.

There are no comments on this comment yet.