https://github.com/rorysroes/fast_algorithm_fft

Implement Cooley–Tukey FFT algorithm with C
https://github.com/rorysroes/fast_algorithm_fft

bit-reversal butterfly-structures discrete-fourier-transform fast-fourier-transform fft quicksort-algorithm

Last synced: about 2 months ago
JSON representation

Implement Cooley–Tukey FFT algorithm with C

• Host: GitHub
• URL: https://github.com/rorysroes/fast_algorithm_fft
• Owner: rorysroes
• Created: 2015-04-17T07:33:43.000Z (about 10 years ago)
• Default Branch: quick-median
• Last Pushed: 2017-02-18T09:28:56.000Z (over 8 years ago)
• Last Synced: 2025-03-24T03:53:07.921Z (2 months ago)
• Topics: bit-reversal, butterfly-structures, discrete-fourier-transform, fast-fourier-transform, fft, quicksort-algorithm
• Language: C++
• Homepage:
• Size: 24.4 KB
• Stars: 7
• Watchers: 2
• Forks: 3
• Open Issues: 1
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        

## Use quicksort algorithm to find median 

[Quick Median Code] (https://github.com/rorysroes/Fast_Algorithm_FFT/blob/quick-median/median.cpp)：

This project I implemented quicksort algorithm to find median value in the sequence.