An extremely simple implementation of an FFT in OCaml. As in copy-paste the code
into utop and run it. The code is entirely tail recursive. It is not performant.
ColinShaw/ocaml-simple-fft
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
| Name | Name | Last commit date | ||
|---|---|---|---|---|