Saved on this device

Follow your curiosity

What discovery has been shared with you?

FACTREE gives you something interesting to discover every day — and something worth talking about together.

Start with one fact. Explore it, go deeper, then follow whichever branch catches your imagination.

Choose subjects for a surprise

Exploring any topic

Begin your discovery

Your next discovery is one click away.

Choose one or more subjects above, or leave Any Topic selected and let curiosity decide.

Mathematics

The Fast Fourier Transform: Algorithms and Applications

Quick fact

The Fast Fourier Transform (FFT) computes the same result as the naive Discrete Fourier Transform but in just O(N log N) operations instead of O(N^2). For a signal of one million points, this cuts the computation from about a trillion operations to about 20 million—a speedup of roughly 50,000 times.

Why this is interesting

You’ve probably seen a slow-loading image or used a concert lighting app that vibrates with music. What if I told you that a single algorithm—the Fast Fourier Transform—is behind these feats, turning hours of computation into milliseconds?