Question

in problem set 2, problem 3, I'm confused on what the upper bound should be? I feel like what is written for the upper bound formula is a typo?

Answer 1

http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-1/lecture-4-machine-interpretation-of-a-program/MIT6_00SCS11_ps1.pdf

Answer 2

I know that when I first did this, my upper bound came out too low, and I just used the total balance as an upper bound, which worked. I just redid
it using their upper bound estimate, and it was fine - the upper bound
was above what was needed. Perhaps ... dunno - don't have my original
anymore. Have you printed the upper bound to see if it looks reasonable?

Answer 3

well to be honest, I didnt even get that far. I was putting the code in and I spent problably 10 minutes looking at it and trying to justify the algorithm before I gave up and came here. I feel like it wouldn't actually matter what I use; it would work either way. I just wanted someone else's opinion. Thanks for that :)