backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-09 07:32:54 +08:00
Code Issues Projects Releases Wiki Activity

Update fast_fourier_transform.cpp

Browse Source
This commit is contained in:
Ameya Chawla
2021-10-22 11:54:26 +05:30
committed by GitHub
parent f8dd34dedd
commit c63bb71e43
1 changed files with 11 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
numerical_methods/fast_fourier_transform.cpp
View File

@@ -103,8 +103,15 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,uint64_t n)
static void test() {
/* descriptions of the following test */
std::complex<double> t1[2]={1,2}; /// Test case 1
std::complex<double> t2[4]={1,2,3,4}; /// Test case 2
auto *t1= new std::complex<double>[2]; /// Test case 1
auto *t2= new std::complex<double>[4];; /// Test case 2
t1[0]={1,0};
t1[1]={2,0};
t2[0]={1,0};
t2[1]={2,0};
t2[2]={3,0};
t2[3]={4,0};
uint64_t n1 = 2;
uint64_t n2 = 4;
@@ -133,6 +140,8 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,uint64_t n)
o2++;
}
delete[] t1;
delete[] t2;
}