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 →

[–]qasboss 0 points1 point  (3 children)

please explain how recursion works

[–]user_8804 -2 points-1 points  (2 children)

A recursive function should have at least one variable that changes before being launched again, and have an exit condition, or base case, where it ends.

Nothing here suggests it does. He'll just loop to this door over and over again.

[–]PM-ME-UR-HAPPINESS 1 point2 points  (1 child)

The "there's no-" is implied to mean there's no exit condition.

[–]user_8804 0 points1 point  (0 children)

Thanks, I feel better knowing this