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