/explore
|
You are here 
|
blog.demofox.org | ||
| | | | |
cp-algorithms.com
The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection. |
|
| | | | | ||
| | | | |
www.rorvswild.com
So using Ruby, what is the largest Fibonacci number we can calculate quickly? |
|
| | | | | ||
| | | | |
www.oranlooney.com
A common example of recursion is the function to calculate the \(n\)-th Fibonacci number: def naive_fib(n): if n < 2: return n else: return naive_fib(n-1) + naive_fib(n-2) This follows the mathematical definition very closely but it's performance is terrible: roughly \(\mathcal{O}(2^n)\). This is commonly patched up with dynamic programming. Specifically, either the memoization: from functools import lru_cache @lru_cache(100) def memoized_fib(n): if n < 2: return n else: return memoized_fib(n-1) + memoiz... |
|
| | | | | ||
| | | | |
deejaygraham.github.io
a triumph of style over substance |
|
| | | |||
