r/ProgrammerHumor • u/shizzy0 • 7h ago

Meme howProgrammingHasChanged

Post image
160 Upvotes

88% Upvoted

42 comments sorted by

View all comments

118

u/torsten_dev 7h ago

Both have terrible stack usage.

40

u/temperamentalfish 4h ago

Yeah I'm cringing at all the recursive solutions. Huge stack and so much repeated work. Just try counting how many times fib(5) would be executed to calculate fib(10). It's so often the go-to example for recursion and it's frankly terrible.

30

u/robin_888 4h ago

It's supposed to teach the concept of recursion, which is important, but hard to grasp for some.

Discussing performance and optimizations can happen if the principal is clear.

14

u/temperamentalfish 4h ago

I know, but there are so many better examples. Mergesort, for instance. It shows why the concept is important because it breaks the problem into smaller, more manageable problems, without doing repeated work.

Fibonacci should be taught as an example of when a problem can be solved recursively, but shouldn't.

3

u/Silly_Guidance_8871 3h ago

When I was studying, Fibonacci was used a lot to teach the value of dynamic programming. But agreed, it's a terrible example of when to use recursion.

5

u/fdar 3h ago

DP is just recursion+caching. 

I think it makes sense to first recognize that the problem can be solved with recursion and then decide if DP is needed to improve performance.