采用DIT和DIF两种蝶形算法实现的FFT变换，其中myfft1是DIT算法，myfft2是DIF算法，已经过测试，可以方便使用。-DIT and DIF using two algorithms of FFT butterfly transformation, which myfft1 is DIT algorithm, myfft2 is the DIF algorithm, has been tested, it will be

时间抽取(DIT)基2FFT算法: 输入:先输入数组长度(8,16,32...),再输入数组内容. 输出:FFT变换结果.-Time taken (DIT) based 2FFT algorithm: Input: enter the array length (8,16,32 ...), and then type the array elements. Output: FFT transform results.

对要求的2种实数序列进行基2－DIT和基2－DIF FFT变换-Base 2-DIT and the base 2-DIF FFT transform is required for two kinds of real sequence