417d3b5fff
The bottom-up solution run in O(n) time instead of O(2^n) time, which the
recursive solution runs as:
```
def fib(n):
return fib(n - 2) + fib(n - 1)
```
Remember that exponential algorithms are usually recursive algorithms with
multiple sibling calls to itself.
|
||
|---|---|---|
| .. | ||
| advent-of-code-2019 | ||
| crack_the_coding_interview | ||
| data_structures_and_algorithms | ||
| deepmind | ||
| groceries | ||
| habit-screens | ||
| haskell-programming-from-first-principles | ||
| README.md | ||
Scratch
The purpose of the scratch directory is to host practice exercises. Practice
encompasses things like working on data structures and algorithms problems for
upcoming coding interviews or general aptitude as well as writing code snippets
to help me learn a new programming language or understand an unfamiliar concept.