c语言数据结构(5)

问题4.2：代码实现（主函数）

#include #define NUM 200void sortArray(int array[], int n);int main(){int scorelist[NUM], i, n=0;FILE *in, *out;if((in = fopen(\printf(\return 1;}if((out = fopen(\printf(\return 1;}while(!feof(in))fscanf(in,\);sortArray(scorelist, n);for(i=0; i

{

#define NUM 200问题4.2：一种模块化更好的实现FILE *in;int readList(int array[ ]);int n=0;

void sortArray(int array[ ], int n);if((in = fopen(\

printf(\void writeList(int array[ ], int n);

exit(1);

int main()

{int scorelist[NUM], n;n = readList(scorelist);

sortArray(scorelist, n);

writeList(scorelist, n);return 0;}

}

while(!feof(in))fscanf(in,\

fclose(in);return n;

}

void writeList(int array[ ], int n){

FILE *out;int I;

if((out = fopen(\printf(\exit(1);}

for(i=0; i

fprintf(out, \fclose(out);

}

22

C程序设计基础

问题4.2：测试及常见问题

若文件scorelist.in内容为：

5875628698

程序运行后文件scorelist.out内容为：

9886756258

?

若文件scorelist.in文件尾有一个回车，则会发生什么现象？如何调试？

问题4.2：修改主函数

#include #define NUM 200

void sortArray(int array[], int n);int main(){

int scorelist[NUM], i, n=0;FILE *in, *out;

if((in = fopen(\

printf(\return 1;

}

if((out = fopen(\

printf(\return 1;

}

while(fscanf(in,\)>0)

n++;

sortArray(scorelist, n);for(i=0; i

fprintf(out, \

return 0;}

问题4.2：另一个常用排序方法（冒泡排序）*

void sortArray(int array[], int n){

int i, j, tmp;for(i=0; i

if(array[i] < array[j]){tmp = array[i];array[i] = array[j];array[j] = tmp;}}}