2024.7.18 作业

昨天的作业增加增删改查功能

代码：

/*******************************************/

文件名：Xs.c

功能：函数内容

/*******************************************/

#include "Xs.h"
int list_empty(struct Class *class_1)
{
    return class_1->size == 0;
}
int list_full(struct Class *class_1)
{
    return class_1->size == MAX;
}
void print_menu()
{
    printf("\t\t======1、录入学生信息======\n");
    printf("\t\t======2、查看学生信息======\n");
    printf("\t\t======3、查看最高分和最低分的学生信息======\n");
    printf("\t\t======4、查看学生的总成绩和平均成绩======\n");
    printf("\t\t======5、按成绩排序，根据升降序确定排序功能======\n");
    printf("\t\t======6、查找学生姓名，确定是否存在======\n");
    printf("\t\t======7、查找学生学号，确定是否存在======\n");
    printf("\t\t======8、查找学生成绩，确定是否存在======\n");
    printf("\t\t======9、增加学生信息======\n");
    printf("\t\t======10、删除学生信息======\n");
    printf("\t\t======11、修改学生信息======\n");
    printf("\t\t======12、按学号排序======\n");
    printf("\t\t======0、退出======\n");
}
void shuru(struct Class *class_1)
{
    for (int i = 0; i < class_1->size; i++)
    {
        printf("请输入第%d个学生的姓名：", i + 1);
        scanf("%s", class_1->student[i].name);
        printf("请输入第%d个学生的性别：", i + 1);
        scanf("%s", class_1->student[i].gender);
        printf("请输入第%d个学生的年龄：", i + 1);
        scanf("%d", &class_1->student[i].age);
        printf("请输入第%d个学生的成绩：", i + 1);
        scanf("%f", &class_1->student[i].score);
        class_1->student[i].num_id = i + 1;
    }
}
//查看函数
void see(struct Class *class_1)
{
    printf("学号\t姓名\t性别\t年龄\t成绩\n");
    for (int i = 0; i < class_1->size; i++)
    {
        printf("%d\t%s\t%s\t%d\t%.2f\n", class_1->student[i].num_id, class_1->student[i].name, class_1->student[i].gender, class_1->student[i].age, class_1->student[i].score);
    }
}
//最高分最低分函数
void max_min(struct Class *class_1)
{
    struct Stu max; //存储最高分信息
    struct Stu min; //存储最低分信息
    int max_value = 0;
    int min_value = 100;
    for (int i = 0; i < class_1->size; i++)
    {
        if (class_1->student[i].score > max_value)
        {
            max_value = class_1->student[i].score; //分数传递后继续参与比较
            max = class_1->student[i];
        }
    }
    for (int i = 0; i < class_1->size; i++)
    {
        if (class_1->student[i].score < min_value)
        {
            min_value = class_1->student[i].score;
            min = class_1->student[i];
        }
    }
    printf("最高分的学生是%d号的%s，成绩为%.2f\n", max.num_id, max.name, max.score);
    printf("最低分的学生是%d号的%s，成绩为%.2f\n", min.num_id, min.name, min.score);
}
//总分平均分函数
void total_ave(struct Class *class_1)
{
    float total = 0;
    float ave = 0;
    for (int i = 0; i < class_1->size; i++)
    {
        total = total + class_1->student[i].score;
    }
    ave = (float)total / class_1->size;
    printf("总成绩为%.2f,平均分为%.2f\n", total, ave);
}
//排序函数
void sort(struct Class *class_1, int way)
{
    struct Stu temp; //存储过度值
    switch (way)     //判断升序或降序
    {
    case 1:
    {
        for (int i = 1; i < class_1->size; i++)
        {
            for (int j = 0; j < class_1->size - i; j++)
            {
                if (class_1->student[j].score > class_1->student[j + 1].score)
                {
                    temp = class_1->student[j];
                    class_1->student[j] = class_1->student[j + 1];
                    class_1->student[j + 1] = temp;
                }
            }
        }
    }
    break;
    case 0:
    {
        for (int i = 1; i < class_1->size; i++)
        {
            for (int j = 0; j < class_1->size - i; j++)
            {
                if (class_1->student[j].score < class_1->student[j + 1].score)
                {
                    temp = class_1->student[j];
                    class_1->student[j] = class_1->student[j + 1];
                    class_1->student[j + 1] = temp;
                }
            }
        }
    }
    break;
    default:
        printf("error\n");
    }
}
//查看函数
void seek_name(struct Class *class_1)
{
    int num_in = 0;
    char seek_name[20] = {""};
    printf("请输入想要查找的学生的姓名：");
    scanf("%s", &seek_name);
    for (int i = 0; i < class_1->size; i++)
    {
        if (strcmp(class_1->student[i].name, seek_name) == 0) //判断字符是否相等
        {
            printf("这位学生是第%d号，性别为%s，年龄为%d,成绩为%.2f\n", class_1->student[i].num_id, class_1->student[i].gender, class_1->student[i].age, class_1->student[i].score);
            num_in = 1; //表示已经找到学生
        }
    }
    if (num_in == 0) //判断未找到学生
    {
        printf("该学生不存在于该班级\n");
    }
}
void seek_id(struct Class *class_1)
{
    int num_in = 0;
    int seek_id = 0;
    printf("请输入想要查找的学生的学号：");
    scanf("%d", &seek_id);
    for (int i = 0; i < class_1->size; i++)
    {
        if (class_1->student[i].num_id == seek_id) //判断字符是否相等
        {
            printf("这位学生是%s，性别为%s，年龄为%d,成绩为%.2f\n", class_1->student[i].name, class_1->student[i].gender, class_1->student[i].age, class_1->student[i].score);
            num_in = 1; //表示已经找到学生
        }
    }
    if (num_in == 0) //判断未找到学生
    {
        printf("该学生不存在于该班级\n");
    }
}
void seek_score(struct Class *class_1)
{
    int num_in = 0;
    float seek_score = 0;
    printf("请输入想要查找的学生的成绩：");
    scanf("%f", &seek_score);
    for (int i = 0; i < class_1->size; i++)
    {
        if (class_1->student[i].score == seek_score) //判断字符是否相等
        {
            printf("这位学生是第%d号的%s，性别为%s，年龄为%d\n", class_1->student[i].num_id, class_1->student[i].name, class_1->student[i].gender, class_1->student[i].age);
            num_in = 1; //表示已经找到学生
        }
    }
    if (num_in == 0) //判断未找到学生
    {
        printf("该学生不存在于该班级\n");
    }
}
void increase(struct Class *class_1)
{
    int join = 0;
    printf("请输入你想在哪个序号位加入学生：");
    scanf("%d", &join);
    int join_num = 0;
    printf("你想在此处加入学生数为：");
    scanf("%d", &join_num);
    class_1->size = class_1->size + join_num;
    if (NULL == class_1 || list_full(class_1) || join < 0 || join + join_num - 1 > class_1->size)
    {
        printf("插入失败\n");
        return;
    }
    for (int i = class_1->size - join_num; i >= join - 1; i--)
    {
        class_1->student[i + join_num] = class_1->student[i];
        class_1->student[i + join_num].num_id = i + join_num + 1;
    }
    for (int i = join - 1; i < join + join_num - 1; i++)
    {
        printf("请输入第%d个学生的姓名：", i + 1);
        scanf("%s", class_1->student[i].name);
        printf("请输入第%d个学生的性别：", i + 1);
        scanf("%s", class_1->student[i].gender);
        printf("请输入第%d个学生的年龄：", i + 1);
        scanf("%d", &class_1->student[i].age);
        printf("请输入第%d个学生的成绩：", i + 1);
        scanf("%f", &class_1->student[i].score);
        class_1->student[i].num_id = i + 1;
    }
}
void omit(struct Class *class_1)
{
    int out = 0;
    printf("请输入你想在哪个序号位删除学生：");
    scanf("%d", &out);
    int out_num = 0;
    printf("你想在此处删除学生数为：");
    scanf("%d", &out_num);
    class_1->size = class_1->size - out_num;
    if (NULL == class_1 || list_empty(class_1) || out < 0 || out + out_num >= class_1->size)
    {
        printf("插入失败\n");
        return;
    }
    for (int i = out - 1; i <= class_1->size - out_num; i++)
    {
        class_1->student[i] = class_1->student[i + out_num];
        class_1->student[i].num_id = i + 1;
    }
}
void chan(struct Class *class_1)
{
    struct Class *class_temp = (struct Class *)malloc(10000);
    int cha = 0;
    printf("请输入你想在哪个序号位修改学生：");
    scanf("%d", &cha);
    int cha_num = 0;
    printf("你想在此处修改学生数为：");
    scanf("%d", &cha_num);
    if (NULL == class_1 || list_empty(class_1) || cha <= 0 || cha + cha_num >= class_1->size)
    {
        printf("插入失败\n");
        return;
    }
    for (int i = cha - 1; i < cha + cha_num - 1; i++)
    {
        printf("请输入第%d个学生的姓名：", i + 1);
        scanf("%s", class_temp->student[i].name);
        printf("请输入第%d个学生的性别：", i + 1);
        scanf("%s", class_temp->student[i].gender);
        printf("请输入第%d个学生的年龄：", i + 1);
        scanf("%d", &class_temp->student[i].age);
        printf("请输入第%d个学生的成绩：", i + 1);
        scanf("%f", &class_temp->student[i].score);
        class_temp->student[i].num_id = i + 1;
    }
    for (int i = cha - 1; i < cha + cha_num - 1; i++)
    {
        class_1->student[i] = class_temp->student[i];
    }
}
void back(struct Class *class_1)
{
    struct Stu temp; //存储过度值
    for (int i = 1; i < class_1->size; i++)
    {
        for (int j = 0; j < class_1->size - i; j++)
        {
            if (class_1->student[j].num_id > class_1->student[j + 1].num_id)
            {
                temp = class_1->student[j];
                class_1->student[j] = class_1->student[j + 1];
                class_1->student[j + 1] = temp;
            }
        }
    }
}

/*******************************************/

文件名：main.c

功能：运行主程序

/*******************************************/

#include "Xs.h"
//主函数
int main(int argc, char const *argv[])
{
    struct Class *class_1 = (struct Class *)malloc(100000); //存储学生信息
    memset(class_1, 0, sizeof(class_1));
    printf("请输入这个班级的实际人数：");
    scanf("%d", &class_1->size);
    while (1)
    {
        int choose = 0;
        print_menu(); //调用菜单
        printf("请输入你想要进行的操作编号：");
        scanf("%d", &choose);
        switch (choose) //判断操作
        {
        case 1:
        {
            shuru(class_1); //调用输入函数
        }
        break;
        case 2:
        {
            see(class_1); //调用查看函数
        }
        break;
        case 3:
        {
            max_min(class_1); //调用最高分最低分函数
        }
        break;
        case 4:
        {
            total_ave(class_1); //调用总分平均分函数
        }
        break;
        case 5:
        {
            int choosen = 0;
            printf("需要升序还是降序（输入1或0）：");
            scanf("%d", &choosen);
            sort(class_1, choosen); //调用排序函数
        }
        break;
        case 6:
        {
            seek_name(class_1); //调用查找函数
        }
        break;
        case 7:
        {
            seek_id(class_1);
        }
        break;
        case 8:
        {
            seek_score(class_1);
        }
        break;
        case 9:
        {
            increase(class_1);
        }
        break;
        case 10:
        {
            omit(class_1);
        }
        break;
        case 11:
        {
            chan(class_1);
        }
        break;
        case 12:
        {
            back(class_1);
        }
        break;
        case 0:
            return 0;
        default:
            printf("error\n");
        }
    }
    free(class_1);
    return 0;
}

/*******************************************/

文件名：Xs.h

功能：声明函数和结构体

/*******************************************/

#ifndef XS_H
#define XS_H
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 100
struct Stu
{
    int num_id;
    char name[20];
    char gender[20];
    int age;
    float score;
};
struct Class
{
    struct Stu student[MAX];
    int size;
};
void print_menu();
int list_empty(struct Class *class_1);
int list_full(struct Class *class_1);
void shuru(struct Class *class_1);
void see(struct Class *class_1);
void max_min(struct Class *class_1);
void total_ave(struct Class *class_1);
void sort(struct Class *class_1, int way);
void seek_name(struct Class *class_1);
void seek_id(struct Class *class_1);
void seek_score(struct Class *class_1);
void increase(struct Class *class_1);
void omit(struct Class *class_1);
void chan(struct Class *class_1);
void back(struct Class *class_1);
#endif

结果：

思维导图：