Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 276 Bytes

README.md

File metadata and controls

6 lines (4 loc) · 276 Bytes

Short FFT Reference

This is a quick implementation of the non recursive Cooley-Tukey algorithm.

The purpose of this is to be a quick reference for the code.

if you wish to build the code, make sure you have raylib installed, as it is used here.