Cooley-Tukey Algorithm

From dankwiki

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