From a6594c85c00597b024a68c53b8401a4e9be83955 Mon Sep 17 00:00:00 2001 From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com> Date: Mon, 18 Oct 2021 23:55:35 +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 a562a5955..9e56849e9 100644 --- a/numerical_methods/fast_fourier_transform.cpp +++ b/numerical_methods/fast_fourier_transform.cpp @@ -1,6 +1,6 @@ /** * @file - * @brief A fast Fourier transform (FFT) is an algorithm that computes the + * @brief [A fast Fourier transform (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 * has application in use case scenario where a user wants to find points of a function * in short period time by just using the coefficents of the polynomial function.