Fast Fourier Transform Algorithm | Part 3
Smart Contract Programmer · 17:44
The FFT evaluates a degree-\(n\) polynomial (pad leading zeros so \(n\) is a power of two) at the \(n\) powers of a primitive \(n\)th root of unity \(\omega\) by recursively splitting into even/odd halves, squaring th...