I'm stuck on PS8, the dynamic programming step:

http://dpaste.com/613033/

What happens is that my program doesn't reject values that have too much work in them to qualify. The code is a bit of a mess, but if anyone could take a look at it, I'd very much appreciate it.

Question

I'm stuck on PS8, the dynamic programming step:

http://dpaste.com/613033/

What happens is that my program doesn't reject values that have too much work in them to qualify. The code is a bit of a mess, but if anyone could take a look at it, I'd very much appreciate it.

anonymous · Answer

I don't have time to read through your code at the moment, but I think that in order for a recursive method to be effective, you need to use a memo for the purpose of retrieving results that have already been computed.

anonymous · Answer

If you're having issues with this one, I found this site where a bunch of people have posted their code, a lot of it well-commented. http://curiousreef.com/class/mit-opencourseware-600-introduction/lesson/14/retricen/1/