Check out my first novel, midnight's simulacra!
Cooley-Tukey Algorithm
Jump to navigation
Jump to search
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.