This is a work in progress - implementation not yet finished (16/01/2023)!
A pure and simple implementation of a fast fourier transform in Java using the Cooley-Tukey algorithm.
This code has no dependencies and can be copied and pasted into any project. If you would like to use this code in your project, please include a link to this repo.
- Finish implementation (currently getting "out of index exception")
- Test performance and optimise
- Add build and testing on Github
- Write documentation