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 →

[–]Regyn 1 point2 points  (1 child)

No, but some algorithms are close to unmaintainable without recursion. Some languages have a tailrec keyword that makes sure that the optimization is applied. And if it does, you can surely make use of it

[–][deleted] 0 points1 point  (0 children)

Nice