2 lines (2 loc) · 196 Bytes

Dynamic Programming Example

This simple example qantitatively shows how a recursive algorithm with a time complexity of O(2^n) can have O(n) performance when Dynamic programming is implemented!