Explore >> Select a destination
|
You are here 
|
www.rorvswild.com | ||
| | | | |
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... | |
| | | | |
jakevdp.github.io
|
|
| | | | | [AI summary] The author explains the Cooley-Tukey Fast Fourier Transform algorithm, analyzes its mathematical symmetries, and provides optimized Python implementations ranging from naive matrix multiplication to vectorized NumPy solutions. | |
| | | | |
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. | |
| | | | |
art2science.org
|
|
| | | I use a variety of specialized software for note taking, managing academic papers, etc. Rather than write my own review of Scrivener, I link to someone else's here. I added a comment to her post, about using it with bibliography software. Feel free to add links to your own favorite Scrivener reviews, in the comments.... | ||
