|
|
|
@ -174,4 +174,206 @@ SwapLong(&stu[k].num, &stu[i].num); // 交换学号
|
|
|
|
|
SwapChar(stu[k].name, stu[i].name); // 交换姓名
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 5使数据按升序排序
|
|
|
|
|
int Ascending(float a, float b)
|
|
|
|
|
{
|
|
|
|
|
return a < b; // 这样比较决定了按升序排序,如果a<b,则交换
|
|
|
|
|
}
|
|
|
|
|
// 6使数据按降序排序
|
|
|
|
|
int Descending(float a, float b)
|
|
|
|
|
{
|
|
|
|
|
return a > b;
|
|
|
|
|
}
|
|
|
|
|
// 7交换两个单精度浮点型数据
|
|
|
|
|
void SwapFloat(float *x, float *y)
|
|
|
|
|
{
|
|
|
|
|
float temp;
|
|
|
|
|
temp = *x;
|
|
|
|
|
*x = *y;
|
|
|
|
|
*y = temp;
|
|
|
|
|
}
|
|
|
|
|
// 8交换两个长整型数据
|
|
|
|
|
void SwapLong(long *x, long *y)
|
|
|
|
|
{
|
|
|
|
|
long temp;
|
|
|
|
|
temp = *x;
|
|
|
|
|
*x = *y;
|
|
|
|
|
*y = temp;
|
|
|
|
|
}
|
|
|
|
|
// 9交换两个字符串
|
|
|
|
|
void SwapChar(char x[], char y[])
|
|
|
|
|
{
|
|
|
|
|
char temp[MAX_LEN];
|
|
|
|
|
strcpy(temp, x);
|
|
|
|
|
strcpy(x, y);
|
|
|
|
|
strcpy(y, temp);
|
|
|
|
|
}
|
|
|
|
|
// 10函数功能:按选择法将数组num的元素值按从低到高排序
|
|
|
|
|
void AsSortbyNum(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
int i, j, k, t;
|
|
|
|
|
for (i=0; i<n-1; i++)
|
|
|
|
|
{
|
|
|
|
|
K=i;
|
|
|
|
|
for(j=i+1;j<10;j++)
|
|
|
|
|
{
|
|
|
|
|
if((*compare)(stu[k]num.stu[j].num)) k=j;}
|
|
|
|
|
if(k!=i)
|
|
|
|
|
{t=stu[i].num;stu[i].num=stu[k].num;stu[k].num=t;}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 11函数功能:交换法实现字符串按字典顺序排序
|
|
|
|
|
void AsSortbyNum(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
int i, j, k, t;
|
|
|
|
|
for (i=0; i<n-1; i++)
|
|
|
|
|
{
|
|
|
|
|
k = i;
|
|
|
|
|
for (j=i+1; j<n; j++)
|
|
|
|
|
{
|
|
|
|
|
if (stu[j].num < stu[k].num) k = j;
|
|
|
|
|
}
|
|
|
|
|
if (k != i)
|
|
|
|
|
{
|
|
|
|
|
for (t=0; t<m; t++)
|
|
|
|
|
{
|
|
|
|
|
SwapFloat(&stu[k].score[t], &stu[i].score[t]);
|
|
|
|
|
}
|
|
|
|
|
SwapFloat(&stu[k].sum, &stu[i].sum);
|
|
|
|
|
SwapFloat(&stu[k].aver, &stu[i].aver);
|
|
|
|
|
SwapLong(&stu[k].num, &stu[i].num);
|
|
|
|
|
SwapChar(stu[k].name, stu[i].name);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 12函数功能:按学号查找学生成绩并显示查找结果
|
|
|
|
|
void SearchbyNum(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
long number;
|
|
|
|
|
int i, j;
|
|
|
|
|
printf("Input the number you want to search:");
|
|
|
|
|
scanf("%ld", &number);
|
|
|
|
|
for(i=0;i<n;i++)
|
|
|
|
|
{
|
|
|
|
|
if (stu[i].num==number)
|
|
|
|
|
{
|
|
|
|
|
printf("%ld\t%s\t", stu[i].num, stu[i].name);
|
|
|
|
|
for (j=0; j<m; j++)
|
|
|
|
|
{
|
|
|
|
|
printf("%.0f\t", stu[i].score[j]);
|
|
|
|
|
}
|
|
|
|
|
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
printf("\nNot found!\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 13函数功能:按姓名的字典顺序排出成绩表
|
|
|
|
|
void SearchbyName(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
char x[MAX_LEN];
|
|
|
|
|
int i, j;
|
|
|
|
|
printf("Input the name you want to search:");
|
|
|
|
|
scanf("%s", x);
|
|
|
|
|
for (i=0; i<n; i++)
|
|
|
|
|
{
|
|
|
|
|
if (strcmp(stu[i].name, x) == 0)
|
|
|
|
|
{
|
|
|
|
|
printf("%ld\t%s\t", stu[i].num, stu[i].name);
|
|
|
|
|
for (j=0; j<m; j++)
|
|
|
|
|
{
|
|
|
|
|
printf("%.0f\t", stu[i].score[j]);
|
|
|
|
|
}
|
|
|
|
|
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
printf("\nNot found!\n");
|
|
|
|
|
}
|
|
|
|
|
// 14函数功能:统计各分数段的学生人数及所占的百分比
|
|
|
|
|
void StatisticAnalysis(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
int i, j, t[6];
|
|
|
|
|
for (j=0; j<m; j++)
|
|
|
|
|
{
|
|
|
|
|
printf("For course %d:\n", j+1);
|
|
|
|
|
memset(t, 0, sizeof(t));
|
|
|
|
|
for (i=0; i<n; i++)
|
|
|
|
|
{
|
|
|
|
|
if (stu[i].score[j]>=0 && stu[i].score[j]<60)t[0]++;
|
|
|
|
|
else if (stu[i].score[j]<70) t[1]++;
|
|
|
|
|
else if (stu[i].score[j]<80) t[2]++;
|
|
|
|
|
else if (stu[i].score[j]<90) t[3]++;
|
|
|
|
|
else if (stu[i].score[j]<100) t[4]++;
|
|
|
|
|
else if (stu[i].score[j] == 100) t[5]++;
|
|
|
|
|
}
|
|
|
|
|
for (i=0; i<=5; i++)
|
|
|
|
|
{
|
|
|
|
|
if (i==0) printf("<60\t%d\t%.2f%%\n",t[i],(float)t[i]/n*100);
|
|
|
|
|
else if (i==5) printf("%d\t%d\t%.2f%%\n",
|
|
|
|
|
(i+5)*10,t[i],(float)t[i]/n*100);
|
|
|
|
|
else printf("%d-%d\t%d\t%.2f%%\n",
|
|
|
|
|
(i+5)*10, (i+5)*10+9, t[i], (float)t[i]/n*100);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 15函数功能: 打印学生成绩
|
|
|
|
|
void PrintScore(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
int i, j;
|
|
|
|
|
for (i=0; i<n; i++)
|
|
|
|
|
{
|
|
|
|
|
printf("%ld\t%s\t", stu[i].num, stu[i].name);
|
|
|
|
|
for (j=0; j<m; j++)
|
|
|
|
|
{
|
|
|
|
|
printf("%.0f\t", stu[i].score[j]);
|
|
|
|
|
}
|
|
|
|
|
printf("%.0f\t%.0f\n", stu[i].sum, stu[i].aver);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// 16输出n个学生的学号、姓名及m门课程的成绩到文件student.txt中
|
|
|
|
|
void WritetoFile(STU stu[], int n, int m)
|
|
|
|
|
{
|
|
|
|
|
FILE *fp;
|
|
|
|
|
int i, j;
|
|
|
|
|
if ((fp = fopen("student.txt","w")) == NULL)
|
|
|
|
|
{
|
|
|
|
|
printf("Failure to open score.txt!\n");
|
|
|
|
|
exit(0);
|
|
|
|
|
}
|
|
|
|
|
fprintf(fp, "%d\t%d\n", n, m); //将学生人数和课程门数写入文件
|
|
|
|
|
for (i=0; i<n; i++)
|
|
|
|
|
{
|
|
|
|
|
fprintf(fp, "%10ld%10s", stu[i].num, stu[i].name);
|
|
|
|
|
for (j=0; j<m; j++)
|
|
|
|
|
{
|
|
|
|
|
fprintf(fp, "%10.0f", stu[i].score[j]);
|
|
|
|
|
}
|
|
|
|
|
fprintf(fp, "%10.0f%10.0f\n", stu[i].sum, stu[i].aver);
|
|
|
|
|
}
|
|
|
|
|
fclose(fp);
|
|
|
|
|
}
|
|
|
|
|
//17从文件中读取学生的学号、姓名及成绩等信息写入到结构体数组stu中
|
|
|
|
|
void ReadfromFile(STU stu[],int *n, int *m)
|
|
|
|
|
{
|
|
|
|
|
FILE *fp;
|
|
|
|
|
int i, j;
|
|
|
|
|
if ((fp = fopen("student.txt","r")) == NULL)
|
|
|
|
|
{
|
|
|
|
|
printf("Failure to open score.txt!\n");
|
|
|
|
|
exit(0);
|
|
|
|
|
}
|
|
|
|
|
fscanf(fp, "%d\t%d", n, m); // 从文件中读出学生人数和课程门数
|
|
|
|
|
for (i=0; i<*n; i++) //学生人数保存在n指向的存储单元
|
|
|
|
|
{
|
|
|
|
|
fscanf(fp, "%10ld", &stu[i].num);
|
|
|
|
|
fscanf(fp, "%10s", stu[i].name);
|
|
|
|
|
for (j=0; j<*m; j++)//课程门数保存在m指向的存储单元
|
|
|
|
|
{
|
|
|
|
|
fscanf(fp, "%10f", &stu[i].score[j]); //不能用%10.0f
|
|
|
|
|
}
|
|
|
|
|
fscanf(fp, "%10f%10f", &stu[i].sum, &stu[i].aver);//不能用%10.0f
|
|
|
|
|
}
|
|
|
|
|
fclose(fp);
|
|
|
|
|
}
|