From d60ee17812e1b29821630fc479c52c4793f21b59 Mon Sep 17 00:00:00 2001 From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com> Date: Tue, 26 Oct 2021 01:04:36 +0530 Subject: [PATCH] Update numerical_methods/fast_fourier_transform.cpp Co-authored-by: David Leal --- numerical_methods/fast_fourier_transform.cpp | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/numerical_methods/fast_fourier_transform.cpp b/numerical_methods/fast_fourier_transform.cpp index 63e7f31ed..0ef254dbe 100644 --- a/numerical_methods/fast_fourier_transform.cpp +++ b/numerical_methods/fast_fourier_transform.cpp @@ -2,13 +2,13 @@ * @file * @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 + * 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. + * function + * in a short time by just using the coefficients of the polynomial + * function. * It can be also used to find inverse fourier transform by just switching the value of omega. * @time complexity * this algorithm computes the DFT in O(nlogn) time in comparison to traditional O(n^2).