this post was submitted on 22 Dec 2023
31 points (91.9% liked)
Programming
17489 readers
47 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 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Whenever possible, you should build up a cache dynamically (approaching the desired answer step by step) instead of using recursion, which typically has no answer until it reaches the terminal state and thereby has to propagate all the way down and then propagate back up
This is only particularly relevant for recursive algorithms with multiple dependencies (I.e. our old favorite the fibonocci sequence).
That is unless you're talking about really big problems where you'd want to persist the state to disk as you go so you can resume computation if you, for instance, suffer a power outage while computing step 3,198,217 out of 3,198,218.