From c7dcd92d1bacca73912659424936cdb0de390d96 Mon Sep 17 00:00:00 2001
From: Ameya Chawla <88154798+ameyachawlaggsipu@users.noreply.github.com>
Date: Sat, 23 Oct 2021 11:13:00 +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 ef3d0705e..03b98ee0c 100644
--- a/numerical_methods/fast_fourier_transform.cpp
+++ b/numerical_methods/fast_fourier_transform.cpp
@@ -51,9 +51,9 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,uint8_t n)
     
 	std::complex<double> om=std::complex<double>(cos(2*pi/n),sin(2*pi/n));  ///Calculating value of omega
 
-	std::complex<double> *pe= new std::complex<double>[n/2]; /// Coefficients of even power
+	auto *pe= new std::complex<double>[n/2]; /// Coefficients of even power
 
-	std::complex<double> *po= new std::complex<double>[n/2]; ///Coefficients of odd power
+	auto *po= new std::complex<double>[n/2]; ///Coefficients of odd power
 
 	int k1=0,k2=0;
 	for(int j=0;j<n;j++)
@@ -71,7 +71,7 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,uint8_t n)
 	
 	std::complex<double> *yo=FastFourierTransform(po,n/2); ///Recursive Call
 
-	std::complex<double> *y=new std::complex<double>[n];  /// Final value representation list
+	auto *y=new std::complex<double>[n];  /// Final value representation list
 
 	k1=0,k2=0;