backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-07 22:32:28 +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 12:12:59 +05:30
committed by GitHub
parent ad33e2c7a0
commit eaa7f327b2
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
numerical_methods/fast_fourier_transform.cpp
View File

@@ -38,7 +38,7 @@ namespace numerical_methods {
* @returns y if n!=1
*/
std::complex<double>* FastFourierTransform(std::complex<double>*p,double n)
std::complex<double>* FastFourierTransform(std::complex<double>*p,uint64_t n)
{
if(n==1){
@@ -86,12 +86,12 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,double n)
}
delete[] ye; /// Deleting dynamic array ye
delete[] yo; /// Deleting dynamic array yo
delete[] yo; /// Deleting dynamic array yo
return y;
}
}/// namespace numerical_methods
}// namespace numerical_methods
/**
* @brief Self-test implementations
@@ -113,8 +113,8 @@ std::complex<double>* FastFourierTransform(std::complex<double>*p,double n)
t2[2]={3,0};
t2[3]={4,0};
double n1 = 2;
double n2 = 4;
uint64_t n1 = 2;
uint64_t n2 = 4;
std::vector<std::complex<double>> r1 = {
{3, 0}, {-1, 0}}; /// True Answer for test case 1