From 41c80e04827e2b789b6251c5f3b8616199942d16 Mon Sep 17 00:00:00 2001
From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com>
Date: Fri, 22 Oct 2021 11:17:25 +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 f2c926b06..bc7de700c 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,unsigned long int n)
+std::complex<double>* FastFourierTransform(std::complex<double>*p,double n)
 {
 
 	if(n==1){
@@ -106,8 +106,8 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,unsigned long
     std::complex<double> t1[2]={1,2}; /// Test case 1
     std::complex<double> t2[4]={1,2,3,4}; /// Test case 2
 
-    unsigned long int n1 = 2;
-    unsigned long int n2 = 4;
+    double n1 = 2;
+    double n2 = 4;
     std::vector<std::complex<double>> r1 = {
         {3, 0}, {-1, 0}};  /// True Answer for test case 1