FFT.zip_FFT快速算法完整c代码_automobileafo_railroadadj

#include <stdio.h> #define N 80 void fun(int *w, int p, int n) { int i,j,t; for(i=p+1;i<n;i++) for(j=i;j>i-p-1;j--) {t=w[j]; w[j]=w[j-1]; w[j-1]=t; } } main() { int a[N]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; int i,p,n=15;void NONO (); printf("The original data:\n"); for(i=0; i<n; i++)printf("%3d",a[i]); printf("\n\nEnter p: ");scanf("%d",&p); fun(a,p,n); printf("\nThe data after moving:\n"); for(i=0; i<n; i++)printf("%3d",a[i]); printf("\n\n"); NONO(); } void NONO () {/* 请在此函数内打开文件，输入测试数据，调用 fun 函数，输出数据，关闭文件。 */ FILE *rf,*wf ; int a[N], i, j, p, n ; rf = fopen("in.dat","r") ; wf = fopen("out.dat","w") ; for(i = 0 ; i < 5 ; i++) { fscanf(rf, "%d %d", &n, &p) ; for(j = 0 ; j < n ; j++) fscanf(rf, "%d", &a[j]) ; fun(a, p, n) ; for(j = 0 ; j < n ; j++) fprintf(wf, "%3d", a[j]) ; fprintf(wf, "\n") ; } fclose(rf) ; fclose(wf) ; }