From 7cccbd3d87c33dea034db877940852f1c9adbbb9 Mon Sep 17 00:00:00 2001 From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com> Date: Thu, 21 Oct 2021 08:10:48 +0530 Subject: [PATCH] Update numerical_methods/fast_fourier_transform.cpp Co-authored-by: David Leal --- numerical_methods/fast_fourier_transform.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/numerical_methods/fast_fourier_transform.cpp b/numerical_methods/fast_fourier_transform.cpp index 3c97f2119..a99a3f5fd 100644 --- a/numerical_methods/fast_fourier_transform.cpp +++ b/numerical_methods/fast_fourier_transform.cpp @@ -1,7 +1,7 @@ /** * @file * @brief [A fast Fourier transform - (FFT)](https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f) + * (FFT)](https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f) is an algorithm that computes the * discrete Fourier transform (DFT) of a sequence , or its inverse (IDFT) , this algorithm