this post was submitted on 22 Dec 2023
31 points (91.9% liked)

Programming

17576 readers
125 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities [email protected]



founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
[โ€“] [email protected] 10 points 11 months ago (2 children)

Generally, some algorithms are more easily expressed as recursive functions than iterative loops. ...and vice versa. And realistically, that's how you should choose ninety nine percent of the time.

But if you want to get into the weeds... Prefer iteration unless you know one or more of the following:

  • Your maximum iteration depth is bounded and cannot overflow your machine's stack depth.
  • Your algorithm can be implemented with tail-call recursion AND your language supports the same.
  • Your senior/team lead wants a recursive solution.

Because in environments where none of the above are true, iterative solutions are usually more performant, safer, and better understood.

[โ€“] arthur 2 points 11 months ago* (last edited 11 months ago)

Perfect answer.

load more comments (1 replies)