Ask your own question, for FREE!
MIT 6.00 Intro Computer Science (OCW) 15 Online
OpenStudy (anonymous):

This was a problem taken in lectures on dynamic programming. Can anyone tell me why max(with_i,without_i) is used instead of with_i? Here is the code-http://dpaste.com/766390/

OpenStudy (anonymous):

you have a bunch of different paths through the binary decision tree each time it decides to take or not take an item a different path is made each path starts with a tale or a not take but the path will contain both you want the path that provides the maximum

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!