学生管理系统1.0

//THE METHOD WHICH I USED

1.do-while 运用
2.宏常量定义
3.函数的调用
4.for语句的的调用
5. 数组内数据的调用和增值
6. if语句的调用
7. 数组内函数单个数据的交换
8. return在函数调用中的作用
9. 声明为void 的单个函数在此可无需使用return
10. //#define _CRT_SECURE_NO_DEPRECATE在此可弃用函数不是最佳使用的警告

#define _CRT_SECURE_NO_DEPRECATE
#include<stdio.h>
#define N 30
int readScore(int score[], int num[]);
int linSearch(int num[], int x, int n);
int calcSum(int score[], int num[]);             //求总分
void scoreSort(int score[], int num[], int n);  //分数由高到低排序
void numSort(int score[], int num[], int n);   //学号由小到大排序
void printfScore(int score[], int num[], int n);
void calcDifStu(int stuNUms[], double stuNumPercent[], int score[], int n);                 //统计各分数段的学生数量



int main(void) {
    int score[N] = { 0 }, n = 0, pos = 0,  sum = 0;     //n是输入的人数,pos记录查询到的学生下标
    int num[N] = { 0 }, x = 0,stuNums[5] = { 0 };       //x是要查询的学生的ID,stuNums记录各分数段的学生数量
    double average = 0, stuNumPercent[5] = { 0 };       //stuNumPercent记录各分数段的学生所占百分比

    //输入学生信息
    n = readScore(score, num);
    printf("Total student are %d\n", n);

    //求总分，平均分
    sum = calcSum(score, num);
    average = (double)sum / n;
    printf("Sum is %d,Average is %.2lf\n", sum,average);

    //排序
    scoreSort(score, num, n);
    printf("Sorted scores:\n");
    printfScore(score, num, n);
    numSort(score, num, n);
    printf("Sorted nums:\n");
    printfScore(score, num, n);

    //根据学号查排名及成绩
    scoreSort(score, num, n);//先按成绩排名
    printf("Please enter the ID you want search:");
    scanf("%d", &x);        //输入ID
    printf("\n");
    pos = linSearch(num, x, n);     //获取排名
    printf("We searched this for you:\n");
    printf("your order  and score:%d\t%d\n", pos+1, score[pos]);

    return 0;
}

int readScore(int score[], int num[])
{
    int i = -1;
    do {
        i++;
        printf("Input student's ID and score:");
        scanf("%2d%d", &num[i], &score[i]);
    } while (num[i] > 0 && score[i] >= 0);
    return i;
}

int calcSum(int score[], int num[]) {
    int sum = 0;
    int i = 0;
    while (num[i] > 0 && score[i] >= 0) {
        sum += score[i++];
    }
    return sum;
}
int linSearch(int num[], int x, int n)
{
    int i = 0;
    for (i = 0; i < n; i++) {
        if (num[i] == x) return i;
    }
    return -1;
}
void scoreSort(int score[], int num[], int n)
{
    int i, j=0, k=0, temp1=0;
    int temp2=0;
    for (i = 0; i < n - 1; i++)
    {
        k = i;
        for (j = i + 1; j < n; j++)
        {
            if (score[j] > score[k]) //k是最大的
            {
                k = j;
            }
        } 
        if (k != i) 
        {
            temp1 = score[k];
            score[k] = score[i];
            score[i] = temp1;
            temp2 = num[k];
            num[k] = num[i];
            num[i] = temp2;
        }
    }
}

void numSort(int score[], int num[], int n) {
    int i, j = 0, k = 0, temp1 = 0;
    int temp2 = 0;
    for (i = 0; i < n - 1; i++)
    {
        k = i;
        for (j = i + 1; j < n; j++)
        {
            if (num[j] < num[k]) //k是最小的
            {
                k = j;
            }
        }
        if (k != i)
        {
            temp1 = score[k];
            score[k] = score[i];
            score[i] = temp1;
            temp2 = num[k];
            num[k] = num[i];
            num[i] = temp2;
        }
    }
}

void printfScore(int score[], int num[], int n)
{
    int i = 0;
    for (i = 0; i < n; i++)
    {
        printf("student's order ,ID and score:%d\t%d\t%d\n", i+1,num[i], score[i]);
    }
}

void calcDifStu(int stuNums[], double stuNumPercent[], int score[], int n) {
    int i = 0;
    for (i = 0; i < n; i++)
    {
        if (score[i] >= 90 && score[i] <= 100) {
            stuNums[0]++;
            stuNumPercent[0] = (double)stuNums[0] / n;
        }
        else if (score[i] >= 80 && score[i] < 90) {
            stuNums[1]++;
            stuNumPercent[1] = (double)stuNums[1] / n;
        }
        else if (score[i] >= 70 && score[i] < 80) {
            stuNums[2]++;
            stuNumPercent[2] = (double)stuNums[2] / n;
        }
        else if (score[i] >= 60 && score[i] < 70) {
            stuNums[3]++;
            stuNumPercent[3] = (double)stuNums[3] / n;
        }
        else if (score[i] >= 0 && score[i] < 60) {
            stuNums[4]++;
            stuNumPercent[4] = (double)stuNums[4] / n;
        }
    }
}