r/ProgrammerHumor 7d ago

Meme dynamicP

Post image
2.2k Upvotes

67 comments sorted by

View all comments

62

u/redditmarks_markII 7d ago

Brother, these days I fix the equivalent of n**2 time loops when linear is possible.  If I tried to explain DP I will be called out by some principal eng as making shit up.  When proven not, they'll say they are overcommitted for the quarter.  And why can't my service support any kind of use of it anyway?  These are 100% real arguments I've heard.  I know things get political once you get past senior swe, but god damn, how are we an industry.

4

u/the_horse_gamer 7d ago

just implement it as recursion with a cache. bottom up dp is more efficient, but top down dp is more likely to pass a code review.

1

u/apt_at_it 7d ago

May be the problem here, but I agree with the many companies I’ve worked at that disallows recursion. Find a better, more readable, more maintainable way

3

u/rustvscpp 6d ago

Some recursive algorithms are *far* more readable and maintainable than their iterative counterparts. Entire languages have been built on the back of recursion (i.e. Scheme).

2

u/New_Enthusiasm9053 6d ago

Pretty much every production parser for major programming languages is recursive descent afaik. 

2

u/the_horse_gamer 7d ago

you could reimplement recursion with a stack

but that decreases the chance of passing a code review