panditakshay402/Hacktoberfest

Add Fast Fourier Transform (FFT) Algorithms

Open

#304 opened on Oct 4, 2024

View on GitHubContributor guide
 (4 comments) (0 reactions) (0 assignees)C++ (378 forks)auto 404
good first issuehacktoberfesthacktoberfest-accepted

Repository metrics

Stars
 (110 stars)
PR merge metrics
 (PR metrics pending)

Description

This issue does not include a description.

Contributor guide

Research direction
Study the Cooley Tukey FFT algorithm. Implement an iterative version using bit reversal permutation. Write unit tests with known inputs (e.g., sum of sinusoids) and compare against a reference implementation (e.g., numpy's FFT). Ensure performance optimizations are avoided to keep code readable.
Tech stack
None
Domain
data
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-2 days
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Mostly clear
Prerequisites
C++
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
45