A simple solution to the fibbonacci problem using dynamic programming.
n := positive integer fib n
At most n unique values will be created. Repeated values are taken from the cache. This gives O(n) time complexity.
-
Notifications
You must be signed in to change notification settings - Fork 0
PersonligaPersson/fib_dynamic
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A simple solution to the fibbonacci problem using dynamic programming.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published