From 800730ab617b69cb7a226ce2941eb11dcd0bdeeb Mon Sep 17 00:00:00 2001
From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com>
Date: Thu, 21 Oct 2021 00:46:37 +0530
Subject: [PATCH] fix : added time complexity in documentation

---
 numerical_methods/fast_fourier_transform.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/numerical_methods/fast_fourier_transform.cpp b/numerical_methods/fast_fourier_transform.cpp
index 106dbf5af..3c97f2119 100644
--- a/numerical_methods/fast_fourier_transform.cpp
+++ b/numerical_methods/fast_fourier_transform.cpp
@@ -10,6 +10,8 @@
  * in short period time by just using the coefficents 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).
  * @details
  * https://medium.com/@aiswaryamathur/understanding-fast-fourier-transform-from-scratch-to
   -solve-polynomial-multiplication-8018d511162f