/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 www.rorvswild.com
Exploring Ruby Algorithms for Fibonacci Numbers - RoRvsWild
| | jakevdp.github.io
Understanding the FFT Algorithm | Pythonic Perambulations
5.9 parsecs away

Travel
| | [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
Continued fractions - Algorithms for Competitive Programming
4.2 parsecs away

Travel
| | 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.
| | kevinventullo.com
Fast Exact Integer Roots - Kevin Ventullo
5.7 parsecs away

Travel
| | Suppose you knew that 9,273,284,218,074,431 was a perfect 7th power. How would you compute the 7th root? This is a long overdue sequel to the previous post, in which the author promised to derive an efficient algorithm for computing exact k-th roots of integers. That is, computing the k-th root of an integer assumed to...
| | skiplang.com
Reactivity Overview ยท skip
29.8 parsecs away

Travel
| TL;DR: The runtime for the Skip programming language memoizes (caches) function return values. In addition to traditional memoization, it tracks dependencies on mutable state, such as database values, and automatically updates the memoization cache when values that affected a function's return value change. Multiversion concurrency control (MVCC) allows thousands of parallel tasks to use the cache without any global locks.