OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update fast_fourier_transform.cpp

Browse Source
This commit is contained in:
Ameya Chawla 2021-10-22 11:17:25 +05:30 committed by GitHub
parent 61814f82c8
commit 41c80e0482
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
numerical_methods/fast_fourier_transform.cpp
View File

@ -38,7 +38,7 @@ namespace numerical_methods {
* @returns y if n!=1 * @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){ 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> t1[2]={1,2}; /// Test case 1
std::complex<double> t2[4]={1,2,3,4}; /// Test case 2 std::complex<double> t2[4]={1,2,3,4}; /// Test case 2
unsigned long int n1 = 2; double n1 = 2;
unsigned long int n2 = 4; double n2 = 4;
std::vector<std::complex<double>> r1 = { std::vector<std::complex<double>> r1 = {
{3, 0}, {-1, 0}}; /// True Answer for test case 1 {3, 0}, {-1, 0}}; /// True Answer for test case 1