Simple FFT in Haskell

Published on December 4, 2015 The article develops a simple implementation of the fast Fourier transform in Haskell. Raw performance of the algorithm is explicitly not a goal here; for instance, I use things like nub, Writer, and lists for simplicity. On the other hand, I do pay attention to the algorithmic complexity in terms of the number of arithmetic operations performed; the analysis thereof

[sonesuke]

Simple FFT in Haskell (via @Pocket)