Cooley-Tukey Algorithm

This most well-known of FFT algorithms recursively breaks the DFT of N₁N₂ into DFTs of N₁ and N₂, approaching O(NlogN) for smooth (highly composite) numbers.