summaryrefslogtreecommitdiff
path: root/AlgoDesignAndTechniqueEdxJava/pdfs/AlgorithmicDesignAndTechniques/week2_algorithmic_warmup/01_intro_2_fibonaccinumbers3.pdf
diff options
context:
space:
mode:
authorHaidong Ji2018-12-28 14:58:39 -0600
committerHaidong Ji2018-12-28 14:58:39 -0600
commit27e7cf18d35a1dc2c8ad2acf9a77b2799d884a43 (patch)
tree4a3b41df51c7690dea3ef84cca077f62eb62326b /AlgoDesignAndTechniqueEdxJava/pdfs/AlgorithmicDesignAndTechniques/week2_algorithmic_warmup/01_intro_2_fibonaccinumbers3.pdf
parent993716627a616e821aefd8707230221d0dac6cd7 (diff)
Max exp value with paren done!
Wow, translating the algo into code was tricky! Debugging was challenging, frustrating, and ultimately rewarding. Two debugging takeaways I can think of now: 1. Make the test case small, so it's easy to trace the whole thing through; 2. For bigger test case, the example from lecture notes was helpful. I just needed to set breakpoint intelligently to see the min and max arrays. Also, initializing the min and max value, then use the Math.min and Math.max was interesting. I may need to remember that, that's why I have the notes here!
Diffstat (limited to 'AlgoDesignAndTechniqueEdxJava/pdfs/AlgorithmicDesignAndTechniques/week2_algorithmic_warmup/01_intro_2_fibonaccinumbers3.pdf')
0 files changed, 0 insertions, 0 deletions