6 ms·
Absolutely, but I attribute the ability to decompose a problem into overlapping subproblems as an understanding of recursion, so I had implicitly assumed such a
by deepGem 8y ago
Absolutely, but I attribute the ability to decompose a problem into overlapping subproblems as an understanding of recursion, so I had implicitly assumed such an understanding.
- baobabKoodaa 8y agoTry solving some difficult DP problems on CodeForces. You will find that an "understanding of recursion" is not enough to solve them.
- eru 8y agoNo, no, it is an understanding of how to recurse just right. Not an understanding of the concept of recursion in general. Basically, recursion plus memoization is almost the same in terms of power and approach as dynamic programming.
- baobabKoodaa 8y agoNo, it's not, and if you actually tried to solve one of the harder DP problems, this would become very obvious to you. Here's one for you: https://codeforces.com/problemset/problem/1097/G https://codeforces.com/problemset/problem/1097/G It's a dp problem, and you understand how to recurse just right, and you understand memoization, so you'll be able to solve it, right? Link your solution when you reply please.
- baobabKoodaa 8y ago...That's what I thought.
- kortilla 8y agoBehaving like an asshole and not getting a response is not proof of anything other than people not being interested in engaging with assholes.