From 687e278874e5bf1b837f2f1ecc06307578a1d702 Mon Sep 17 00:00:00 2001
From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com>
Date: Fri, 22 Oct 2021 12:17:24 +0530
Subject: [PATCH] Update fast_fourier_transform.cpp

---
 numerical_methods/fast_fourier_transform.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/numerical_methods/fast_fourier_transform.cpp b/numerical_methods/fast_fourier_transform.cpp
index b60f96266..5a91bc4e4 100644
--- a/numerical_methods/fast_fourier_transform.cpp
+++ b/numerical_methods/fast_fourier_transform.cpp
@@ -38,7 +38,7 @@ namespace numerical_methods {
  * @returns y if n!=1
  */
 
-std::complex<double>* FastFourierTransform(std::complex<double>*p,uint64_t n)
+std::complex<double>* FastFourierTransform(std::complex<double>*p,uint8_t n)
 {
 
 	if(n==1){
@@ -113,8 +113,8 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,uint64_t n)
     t2[2]={3,0};
     t2[3]={4,0};
 
-    uint64_t n1 = 2;
-    uint64_t n2 = 4;
+    uint8_t n1 = 2;
+    uint8_t n2 = 4;
     std::vector<std::complex<double>> r1 = {
         {3, 0}, {-1, 0}};  /// True Answer for test case 1