mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
fix : updated documentation
This commit is contained in:
parent
687e278874
commit
4eefaf44ca
@ -51,18 +51,18 @@ 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
|
||||
|
||||
auto *pe= new std::complex<double>[n/2]; /// Coefficents of even power
|
||||
auto *pe= new std::complex<double>[n/2]; /// Coefficients of even power
|
||||
|
||||
auto *po= new std::complex<double>[n/2]; ///Coeeficents 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++)
|
||||
{
|
||||
if(j%2==0){
|
||||
pe[k1++]=p[j]; ///Assigning values of even ceofficents
|
||||
pe[k1++]=p[j]; ///Assigning values of even Coefficients
|
||||
|
||||
}
|
||||
else po[k2++]=p[j]; ///Assigning value of odd coefficents
|
||||
else po[k2++]=p[j]; ///Assigning value of odd Coefficients
|
||||
|
||||
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user