| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2018-08-23 | Done! | Haidong Ji | |
| Reinplemented so that fib is of type BigInteger. With this I was able to get big Fib(n) mod m working. In this particular case, it felt easier with Python, since it is dynamic, not strongly typed. | |||
| 2018-08-12 | Fibonacci naive recursive and 1st optimization done! | Haidong Ji | |
| It was kinda tricky to get it right, with array indexing and how many I needed to calculate. Good thing I was using TDD, which helped quite a bit in getting it done! | |||
 |
index : AlgoDesignAndTechniqueEdxJava | |
| UCSD Algorithmic Design and Techniques exercises done in Java. https://www.edx.org/course/algorithmic-design-techniques-uc-san-diegox-algs200x |
| summaryrefslogtreecommitdiff |