www.pudn.com > 二维傅立叶算法fft2D.rar > temp.cpp

#include "iostream.h" 
#include "math.h" 
#include "malloc.h" 
#include "memory.h" 
 
 
 
typedef struct tagNumber 
{ 
    double re; 
	double im; 
}Number; 
 
Number Add(Number a,Number b) 
{    
	Number c={a.re+b.re,a.im+b.im}; 
	return c; 
} 
 
Number Sub(Number a,Number b) 
{ 
	Number c={a.re-b.re,a.im-b.im}; 
	return c; 
} 
 
Number Mul(Number a,Number b) 
{ 
	Number c={a.re*b.re-a.im*b.im,a.re*b.im+a.im*b.re}; 
	return c; 
} 
 
 
int main() 
{ 
	Number* g; 
	g=new Number[4]; 
     
	for (int j=0;j<4;j++) 
		(*(g+j)).re=(*(g+j)).im=0; 
	for(j=0;j<4;j++) 
	{ 
		cout<<(*(g+j)).re<<"+("<<(*(g+j)).im<<")   "; 
		//f++; 
	 
	} 
	delete []g; 
   return 0; 
}