Recursion is a powerful and elegant problem-solving technique, but the exhaustive nature of certain recursive algorithms can come with a high cost in runtime performance. This week we will be looking at techniques for paring down those costs by trading space for time or accepting approximation in place of exactness.
To complete before meeting
- ✅ Fork Ed workspace and try your hand at speeding up fibonacci.cpp
See Ed post for more info.