← Jargon

Jargonmathematics· 14 claims· 1 episode

Fast Fourier Transform (FFT)

An efficient algorithm for computing the discrete Fourier transform of a signal in O(N log N) time instead of O(N²) time, enabling rapid frequency decomposition of signals for applications like signal processing, compression, and detection

As defined in The Most Underrated Algorithm


Where it comes up · 1