The search for FFT faster than n log n in Haskell | Heykuki News