Explore >> Select a destination
|
You are here 
|
www.adamconrad.dev | ||
| | | | |
victoria.dev
|
|
| | | | | Using a greedy algorithm and dynamic programming to pack my full-time nomad travel bag. | |
| | | | |
piotr.westfalewicz.com
|
|
| | | | | The hardest problem on HackerRank, sorted by Max Score and level "Expert" is Separate The Chocolate. It's worth 250 points and the level "Expert" is the highest one. How to solve it? | |
| | | | |
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... | |
| | | | |
jmanton.wordpress.com
|
|
| | | If $latex Y$ is a $latex \sigma(X)$-measurable random variable then there exists a Borel-measurable function $latex f \colon \mathbb{R} \rightarrow \mathbb{R}$ such that $latex Y = f(X)$. The standard proof of this fact leaves several questions unanswered. This note explains what goes wrong when attempting a "direct" proof. It also explains how the standard proof... | ||
