NumPy - FFT (Fast Fourier Transform)
The Fast Fourier Transform is an algorithm that computes the Discrete Fourier Transform (DFT) efficiently. While a naive DFT implementation requires O(n²) operations, FFT reduces this to O(n log n),…
Read more →Fast
Matrix Exponentiation: Fast Linear Recurrence
Computing the nth Fibonacci number seems trivial. Loop n times, track two variables, done. But what happens when n equals 10^18?
Read more →JavaScript Vitest: Fast Unit Testing
Jest dominated JavaScript testing for years, but it was built for a CommonJS world. As ESM became the standard and Vite emerged as the fastest build tool, running Jest alongside Vite meant…
Read more →Fast Exponentiation: Modular Power Algorithm
Computing 3^13 by multiplying 3 thirteen times works fine. Computing 2^1000000007 the same way? Your program will run until the heat death of the universe.
Read more →