Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
countvajhula.com
|
|
| | | | | [AI summary] The article explores the philosophical and mathematical implications of using the '+' operator in programming languages, discussing whether it should represent addition or concatenation and the broader structures like monoids and groups that these operations embody. | |
| | | | |
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... | |
| | | | |
degoes.net
|
|
| | | | | Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts | |
| | | | |
gist.github.com
|
|
| | | Rename Roam daily files to Obsidian daily files. GitHub Gist: instantly share code, notes, and snippets. | ||
