• 【升级版学生信息管理系统&员工工资信息管理系统】+文件操作+更多细节

    目录

    1.功能介绍（主菜单-有什么功能）

     2.结构体的定义（定义一个结构体类型）

    3.主函数（如何调用分函数）

    4.初始化顺序表（数组加上数组的附加信息）

    5.退出程序同时保存数据到文档

    6.增加员工信息

    7.删除员工信息

     8.按照名字查找（查询工资信息）

    9. 修改员工信息

    10. 按照工资排序

    11.按照工号排序

    12. 计算工资信息

     13.打印工资信息

    14. 统计员工总数

    15.default语句

     16.源代码

    1.功能介绍（主菜单-有什么功能）

    讲一下：这个0123的标号的伏笔

    1. //菜单函数
    2. void Meau(void)
    3. {
    4. 	printf("--------------------------------\n");
    5. 	printf("---  欢迎来到员工工资管理系统 ---\n");
    6. 	printf("--------------------------------\n");
    7. 	printf("----     0.退出程序         ----\n");
    8. 	printf("----     1.增加工资信息     ----\n");
    9. 	printf("----     2.删除工资信息     ----\n");
    10. 	printf("----     3.按名字查工资     ----\n");
    11. 	printf("----     4.修改工资信息     ----\n");
    12. 	printf("----     5.按照工资排序     ----\n");
    13. 	printf("----     6.按照工号排序     ----\n");
    14. 	printf("----     7.计算员工工资     ----\n");
    15. 	printf("----     8.打印工资信息     ----\n");
    16. 	printf("----     9.统计员工人数     ----\n");
    17. 	printf("-------------------------------\n");
    18. }

     2.结构体的定义（定义一个结构体类型）

    1.画一个盒子的嵌套图

    2.各种结构体类型成员的命名和函数命名规范

    3.typedef类型重命名

    4.size和capacity 的引入

    5.计算员工工资放的位置

    1. typedef struct Employee
    2. {
    3. 	char name[20];
    4. 	char id[20];
    5. 	double InitWages;
    6. 	double bonus;
    7. 	double deduct;
    8. 	double NextWages;
    9. 	double taxes;
    10. 	double FinaWages;
    11. }Employee;
    12.  
    13. typedef struct SeqList
    14. {
    15. 	Employee* emp;
    16. 	int size;
    17. 	int capacity;
    18. }SeqList;

    3.主函数（如何调用分函数）

    1.do while语句（前后呼应）

    2.switch case  break;语句和case内部的每一步在干干嘛

    3.传值调用和传址调用

    1. int main()
    2. {
    3. 	int input = 0;
    4.  
    5. 	SeqList ST;
    6. 	InitSeqList(&ST);
    7.  
    8. 	do//先执行一次
    9. 	{
    10. 		Meau();
    11. 		printf("请输入您的选择(提示:请在0-9之间选择):>");
    12. 		scanf("%d", &input);
    13. 		switch (input)
    14. 		{
    15. 		case 0:
    16. 			printf("欢迎您的使用，即将退出程序.\n");
    17. 			SaveSeqList(&ST);
    18. 			break;
    19. 		case 1:
    20. 			printf("********增加工资信息.********\n");
    21. 			int nums = 0;
    22. 			printf("请输入您要增加的员工信息的员工数量:>");
    23. 			scanf("%d", &nums);
    24. 			Employee temp = { 0 };
    25. 			for (int i = 1; i <= nums; i++)
    26. 			{
    27. 				InitEmployee(&temp,i);
    28. 				AddSeqList(&ST,temp);
    29. 			}
    30. 			CountSeqList(&ST);
    31. 			break;
    32. 		case 2:
    33. 			printf("********删除工资信息.********\n");
    34. 			DelSeqList(&ST);
    35. 			break;
    36. 		case 3:
    37. 			printf("********查询工资信息.********\n");
    38. 			SearByName(&ST);
    39. 			break;
    40. 		case 4:
    41. 			printf("********修改工资信息.********\n");
    42. 			ModifySeqList(&ST);
    43. 			CountSeqList(&ST);
    44. 			break;
    45. 		case 5:
    46. 			printf("********按照工资排序.(从高到低)********\n");
    47. 			QsortByFinaWages(&ST,0,ST.size);
    48. 			PrintSeqList(&ST);
    49. 			break;
    50. 		case 6:
    51. 			printf("********按照工号排序.(从小到大)********\n");
    52. 			ShellSortById(&ST);
    53. 			PrintSeqList(&ST);
    54. 			break;
    55. 		case 7:
    56. 			printf("********计算员工工资********\n");
    57. 			CountSeqList(&ST);
    58. 			printf("计算成功.\n");
    59. 			break; 
    60. 		case 8:
    61. 			printf("********打印工资信息********\n");
    62. 			PrintSeqList(&ST);
    63. 			break;
    64. 		case 9:
    65. 			printf("********统计员工人数********\n");
    66. 			printf("当前系统人数:%d\n", ST.size);
    67. 		default:
    68. 			printf("********输入错误，请重新输入********\n");
    69. 			break;
    70. 		}
    71. 	} while (input);
    72. }

    以下是功能的具体实现

    4.初始化顺序表（数组加上数组的附加信息）

    1.size和capacity的关系-->扩容（检查是否满了）

    2.初始化

    3.把上一次的数据加载到文件中-->持久化

    主：

    1. SeqList ST;
    2. 	InitSeqList(&ST);

    分：

    1. void CheckCapacity(SeqList* ps)
    2. {
    3. 	if (ps->size == ps->capacity)
    4. 	{
    5. 		int newcapacity = 2 * ps->capacity;
    6. 		Employee* temp = (Employee*)realloc(ps->emp,sizeof(Employee) * newcapacity);
    7. 		if (temp==NULL)
    8. 		{
    9. 			perror("CheckCapacity::realloc");
    10. 			return;
    11. 		}
    12. 		ps->emp = temp;
    13. 		ps->capacity = newcapacity;
    14. 		printf("扩容成功\n");
    15. 	}
    16. }
    17.  
    18. void LoadSeqList(SeqList* ps)
    19. {
    20. 	FILE* pf = fopen("D:\\桌面\\test.txt", "rb");
    21. 	if (pf == NULL)
    22. 	{
    23. 		perror("LoadSeqList::fopen");
    24. 		return;
    25. 	}
    26. 	Employee temp = { 0 };
    27. 	while (fread(&temp, sizeof(Employee), 1, pf))
    28. 	{
    29. 		CheckCapacity(ps);
    30. 		ps->emp[ps->size] = temp;
    31. 		ps->size++;
    32. 	}
    33.  
    34. 	fclose(pf);
    35. 	pf = NULL;
    36. }
    37.  
    38. void InitSeqList(SeqList* ps)
    39. {
    40. 	ps->emp = (Employee*)malloc(sizeof(Employee) * 4);
    41. 	if (ps->emp == NULL)
    42. 	{
    43. 		perror("InitSeqList::malloc");
    44. 		return;
    45. 	}
    46. 	ps->size = 0;
    47. 	ps->capacity = 4;
    48.  
    49. 	LoadSeqList(ps);
    50. }

    5.退出程序同时保存数据到文档

    1.文件的分类，为什么要有文件操作

    2.关于fopen函数,fread函数，fwrite函数

    主函数调用

    1. 		case 0:
    2. 			printf("欢迎您的使用，即将退出程序.\n");
    3. 			SaveSeqList(&ST);
    4. 			break;

    分函数实现

    1. void SaveSeqList(SeqList* ps)
    2. {
    3. 	FILE* pf = fopen("D:\\桌面\\test.txt", "wb");
    4. 	if (pf == NULL)
    5. 	{
    6. 		perror("LoadSeqList::fopen");
    7. 		return;
    8. 	}
    9.  
    10. 	for (int i = 0; i < ps->size; i++)
    11. 	{
    12. 		fwrite(ps->emp + i, sizeof(Employee), 1, pf);
    13. 	}
    14.  
    15. 	fclose(pf);
    16. 	pf = NULL;
    17. }

    6.增加员工信息

    1.打包操作

    2.顺序表的插入

    主：

    1. 		case 1:
    2. 			printf("********增加工资信息.********\n");
    3. 			int nums = 0;
    4. 			printf("请输入您要增加的员工信息的员工数量:>");
    5. 			scanf("%d", &nums);
    6. 			Employee temp = { 0 };
    7. 			for (int i = 1; i <= nums; i++)
    8. 			{
    9. 				InitEmployee(&temp,i);
    10. 				AddSeqList(&ST,temp);
    11. 			}
    12. 			CountSeqList(&ST);
    13. 			break;

    分：

    1. void InitEmployee(Employee* ps, int i)
    2. {
    3. 	printf("请输入第%d位待插入的员工工资信息:\n",i);
    4. 	printf("请输入员工姓名:>");
    5. 	scanf("%s", ps->name);
    6. 	printf("请输入员工工号:>");
    7. 	scanf("%s", ps->id);
    8. 	printf("请输入员工的基本工资:>");
    9. 	scanf("%lf", &(ps->InitWages));
    10. 	printf("请输入员工的奖金:>");
    11. 	scanf("%lf", &(ps->bonus));
    12. 	printf("请输入员工的扣款:>");
    13. 	scanf("%lf", &(ps->deduct));
    14. 	printf("请输入员工的税款:>");
    15. 	scanf("%lf", &(ps->taxes));
    16. }
    17.  
    18. void AddSeqList(SeqList* ps, Employee temp)
    19. {
    20. 	CheckCapacity(ps);
    21. 	ps->emp[ps->size] = temp;
    22. 	ps->size++;
    23. 	printf("增加成功.\n");
    24. }

    7.删除员工信息

    0.局部变量和全局变量

    1.输入姓名，定位下标（封装成函数），strcmp函数，不存在返回-1 的原因

    2.存在则执行顺序表的删除操作，覆盖问题

    主：

    1. 		case 2:
    2. 			printf("********删除工资信息.********\n");
    3. 			DelSeqList(&ST);
    4. 			break;

    分：

    1.  
    2. int FindByName(SeqList* ps,char* name)
    3. {
    4. 	for (int i = 0; i < ps->size; i++)
    5. 	{
    6. 		if (strcmp(name, ps->emp[i].name) == 0)
    7. 		{
    8. 			return i;
    9. 		}
    10. 	}
    11. 	return -1;
    12. }
    13.  
    14. void DelSeqList(SeqList* ps)
    15. {
    16. 	if (ps->size == 0)
    17. 	{
    18. 		printf("当前员工总数为0，无法删除.\n");
    19. 	}
    20. 	char name[20] = { 0 };
    21. 	printf("请输入您要删除的员工信息的员工姓名:>");
    22. 	scanf("%s", name);
    23. 	int pos = FindByName(ps,name);
    24. 	if (pos == -1)
    25. 	{
    26. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    27. 		return;
    28. 	}
    29. 	else
    30. 	{
    31. 		int begin = pos + 1;
    32. 		while (begin < ps->size)
    33. 		{
    34. 			ps->emp[begin -1] = ps->emp[begin];
    35. 			begin++;
    36. 		}
    37. 		ps->size--;
    38. 	}
    39. 	printf("删除成功.\n");
    40. }

     8.按照名字查找（查询工资信息）

    1.同上的定位函数

    2.打印下标为i的员工信息

    主：

    1. 		case 3:
    2. 			printf("********查询工资信息.********\n");
    3. 			SearByName(&ST);
    4. 			break;

    分：

    1.  
    2. void SearByName(SeqList* ps)
    3. {
    4. 	char name[20] = { 0 };
    5. 	printf("请输入您要查询的员工信息的员工姓名:>");
    6. 	scanf("%s", name);
    7. 	int pos = FindByName(ps, name);
    8. 	if (pos == -1)
    9. 	{
    10. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    11. 		return;
    12. 	}
    13. 	else
    14. 	{
    15. 		printf("%-20s %-20s %-10s %-10s %-10s %-10s %-10s %-10s\n", "员工姓名", "员工工号", "基本工资", "奖金", "扣款", "应发工资", "税款", "实发工资");
    16. 		printf("%-20s %-20s %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf\n", \
    17. 			ps->emp[pos].name, ps->emp[pos].id, ps->emp[pos].InitWages, ps->emp[pos].bonus, ps->emp[pos].deduct, ps->emp[pos].NextWages, ps->emp[pos].taxes, ps->emp[pos].FinaWages);
    18. 	}
    19. }

    9. 修改员工信息

    1.同上

    2.修改if else if和go to 语句

    主：

    1. 		case 4:
    2. 			printf("********修改工资信息.********\n");
    3. 			ModifySeqList(&ST);
    4. 			CountSeqList(&ST);
    5. 			break;

    分： 

    1. void ModifySeqList(SeqList* ps)
    2. {
    3.  
    4. 	char name[20] = { 0 };
    5. 	printf("请输入您要修改的员工信息的员工姓名:>");
    6. 	scanf("%s", name);
    7. 	int pos = FindByName(ps, name);
    8. 	if (pos == -1)
    9. 	{
    10. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    11. 		return;
    12. 	}
    13. 	char choice[20] = { 0 };
    14. rechoice:
    15. 	printf("请输入你要修改的信息项目名称");
    16. 	printf("(提示：您可选择输入员工工号，基本工资，奖金，扣款，税款):>");
    17. 	scanf("%s", choice);
    18. 	printf("请输入修改后的该信息项目值：>");
    19. 	if (strcmp(choice, "员工工号") == 0)
    20. 	{
    21. 		scanf("%s", ps->emp[pos].id);
    22. 	}
    23. 	else if (strcmp(choice, "基本工资") == 0)
    24. 	{
    25. 		scanf("%lf", &(ps->emp[pos].InitWages));
    26. 	}
    27. 	else if (strcmp(choice, "奖金") == 0)
    28. 	{
    29. 		scanf("%lf", &(ps->emp[pos].bonus));
    30. 	}
    31. 	else if (strcmp(choice, "扣款") == 0)
    32. 	{
    33. 		scanf("%lf", &(ps->emp[pos].deduct));
    34. 	}
    35. 	else if (strcmp(choice, "税款") == 0)
    36. 	{
    37. 		scanf("%lf", &(ps->emp[pos].taxes));
    38. 	}
    39. 	else
    40. 	{
    41. 		printf("请在提示中给出的选项中做出选择！\n");
    42. 		goto rechoice;
    43. 	}
    44. 	printf("修改成功.\n");
    45. }

    10. 按照工资排序

    1.快速排序的原理

    主：

    1. 		case 5:
    2. 			printf("********按照工资排序.(从高到低)********\n");
    3. 			QsortByFinaWages(&ST,0,ST.size);
    4. 			PrintSeqList(&ST);
    5. 			break;

    分：

    1. void QsortByFinaWages(SeqList* ps, int begin, int end)
    2. {
    3. 	if (begin >= end)
    4. 	{
    5. 		return;
    6. 	}
    7. 	int keyi = begin;
    8. 	int left = begin, right = end;
    9. 	while (left < right)
    10. 	{
    11. 		while (left < right && ps->emp[right].FinaWages <= ps->emp[keyi].FinaWages)
    12. 		{
    13. 			right--;
    14. 		}
    15. 		while (left < right && ps->emp[left].FinaWages >= ps->emp[keyi].FinaWages)
    16. 		{
    17. 			left++;
    18. 		}
    19. 		Swap(&(ps->emp[left]), &(ps->emp[right]));
    20. 	}
    21. 	int meeti = left;
    22. 	Swap(&(ps->emp[keyi]), &(ps->emp[meeti]));
    23.  
    24. 	QsortByFinaWages(ps, begin, meeti - 1);
    25. 	QsortByFinaWages(ps, meeti+1, end);
    26. }

    11.按照工号排序

    1.直接插入排序

    2.希尔排序的原理

    主：

    1. 		case 6:
    2. 			printf("********按照工号排序.(从小到大)********\n");
    3. 			ShellSortById(&ST);
    4. 			PrintSeqList(&ST);
    5. 			break;

    分：

    1. void ShellSortById(SeqList* ps)
    2. {
    3. 	int gap = ps->size;
    4. 	while (gap > 1)
    5. 	{
    6. 		gap = (gap / 3 + 1);
    7. 		for (int i = 0; i < ps->size - gap; i++)
    8. 		{
    9. 			int end = i;
    10. 			Employee temp = ps->emp[i + gap];
    11. 			while (end >= 0)
    12. 			{
    13. 				if (strcmp(ps->emp[end].id , temp.id)>0)
    14. 				{
    15. 					ps->emp[end + gap] = ps->emp[end];
    16. 					end -= gap;
    17. 				}
    18. 				else
    19. 				{
    20. 					break;
    21. 				}
    22. 			}
    23. 			ps->emp[end + gap] = temp;
    24. 			
    25. 		}
    26. 	}
    27. }

    12. 计算工资信息

    数学计算

    主：

    1. 		case 7:
    2. 			printf("********计算员工工资********\n");
    3. 			CountSeqList(&ST);
    4. 			printf("计算成功.\n");

    分：

    1. void CountSeqList(SeqList* ps)
    2. {
    3. 	for (int i = 0; i < ps->size; i++)
    4. 	{
    5. 		ps->emp[i].NextWages = ps->emp[i].InitWages + ps->emp[i].bonus - ps->emp[i].deduct;
    6. 		ps->emp[i].FinaWages = ps->emp[i].NextWages - ps->emp[i].taxes;
    7. 	}
    8.  
    9. }

     13.打印工资信息

    格式控制

    主：

    1. 		case 8:
    2. 			printf("********打印工资信息********\n");
    3. 			PrintSeqList(&ST);
    4. 			break;

    分：

    1. void PrintSeqList(SeqList* ps)
    2. {
    3. 	printf("%-20s %-20s %-10s %-10s %-10s %-10s %-10s %-10s\n", "员工姓名", "员工工号", "基本工资", "奖金", "扣款", "应发工资","税款","实发工资");
    4. 	for (int i = 0; i < ps->size; i++)
    5. 	{
    6. 		printf("%-20s %-20s %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf\n",\
    7. 			ps->emp[i].name,ps->emp[i].id, ps->emp[i].InitWages, ps->emp[i].bonus, ps->emp[i].deduct,ps->emp[i].NextWages,ps->emp[i].taxes,ps->emp[i].FinaWages);
    8. 	}
    9. }

    14. 统计员工总数

    1. 		case 9:
    2. 			printf("********统计员工人数********\n");
    3. 			printf("当前系统人数:%d\n", ST.size);

    15.default语句

    1. 		default:
    2. 			printf("********输入错误，请重新输入********\n");
    3. 			break;

     16.源代码

    1. //Employee.c
    2.  
    3.  
    4. #define _CRT_SECURE_NO_WARNINGS 1
    5. #define _CRT_SECURE_NO_WARNINGS 1
    6. #include<stdio.h>
    7. #include<stdlib.h>
    8. #include<string.h>
    9. #include<windows.h>
    10.  
    11. typedef struct Employee
    12. {
    13. 	char name[20];
    14. 	char id[20];
    15. 	double InitWages;
    16. 	double bonus;
    17. 	double deduct;
    18. 	double NextWages;
    19. 	double taxes;
    20. 	double FinaWages;
    21. }Employee;
    22.  
    23. typedef struct SeqList
    24. {
    25. 	Employee* emp;
    26. 	int size;
    27. 	int capacity;
    28. }SeqList;
    29.  
    30. void CheckCapacity(SeqList* ps)
    31. {
    32. 	if (ps->size == ps->capacity)
    33. 	{
    34. 		int newcapacity = 2 * ps->capacity;
    35. 		Employee* temp = (Employee*)realloc(ps->emp,sizeof(Employee) * newcapacity);
    36. 		if (temp==NULL)
    37. 		{
    38. 			perror("CheckCapacity::realloc");
    39. 			return;
    40. 		}
    41. 		ps->emp = temp;
    42. 		ps->capacity = newcapacity;
    43. 		printf("扩容成功\n");
    44. 	}
    45. }
    46.  
    47. void LoadSeqList(SeqList* ps)
    48. {
    49. 	FILE* pf = fopen("D:\\桌面\\test.txt", "rb");
    50. 	if (pf == NULL)
    51. 	{
    52. 		perror("LoadSeqList::fopen");
    53. 		return;
    54. 	}
    55. 	Employee temp = { 0 };
    56. 	while (fread(&temp, sizeof(Employee), 1, pf))
    57. 	{
    58. 		CheckCapacity(ps);
    59. 		ps->emp[ps->size] = temp;
    60. 		ps->size++;
    61. 	}
    62.  
    63. 	fclose(pf);
    64. 	pf = NULL;
    65. }
    66.  
    67. void InitSeqList(SeqList* ps)
    68. {
    69. 	ps->emp = (Employee*)malloc(sizeof(Employee) * 4);
    70. 	if (ps->emp == NULL)
    71. 	{
    72. 		perror("InitSeqList::malloc");
    73. 		return;
    74. 	}
    75. 	ps->size = 0;
    76. 	ps->capacity = 4;
    77.  
    78. 	LoadSeqList(ps);
    79. }
    80.  
    81. //菜单函数
    82. void Meau(void)
    83. {
    84. 	printf("--------------------------------\n");
    85. 	printf("---  欢迎来到员工工资管理系统 ---\n");
    86. 	printf("--------------------------------\n");
    87. 	printf("----     0.退出程序         ----\n");
    88. 	printf("----     1.增加工资信息     ----\n");
    89. 	printf("----     2.删除工资信息     ----\n");
    90. 	printf("----     3.按名字查工资     ----\n");
    91. 	printf("----     4.修改工资信息     ----\n");
    92. 	printf("----     5.按照工资排序     ----\n");
    93. 	printf("----     6.按照工号排序     ----\n");
    94. 	printf("----     7.计算员工工资     ----\n");
    95. 	printf("----     8.打印工资信息     ----\n");
    96. 	printf("----     9.统计员工人数     ----\n");
    97. 	printf("-------------------------------\n");
    98. }
    99.  
    100. void SaveSeqList(SeqList* ps)
    101. {
    102. 	FILE* pf = fopen("D:\\桌面\\test.txt", "wb");
    103. 	if (pf == NULL)
    104. 	{
    105. 		perror("LoadSeqList::fopen");
    106. 		return;
    107. 	}
    108.  
    109. 	for (int i = 0; i < ps->size; i++)
    110. 	{
    111. 		fwrite(ps->emp + i, sizeof(Employee), 1, pf);
    112. 	}
    113.  
    114. 	fclose(pf);
    115. 	pf = NULL;
    116. }
    117.  
    118.  
    119.  
    120. void InitEmployee(Employee* ps, int i)
    121. {
    122. 	printf("请输入第%d位待插入的员工工资信息:\n",i);
    123. 	printf("请输入员工姓名:>");
    124. 	scanf("%s", ps->name);
    125. 	printf("请输入员工工号:>");
    126. 	scanf("%s", ps->id);
    127. 	printf("请输入员工的基本工资:>");
    128. 	scanf("%lf", &(ps->InitWages));
    129. 	printf("请输入员工的奖金:>");
    130. 	scanf("%lf", &(ps->bonus));
    131. 	printf("请输入员工的扣款:>");
    132. 	scanf("%lf", &(ps->deduct));
    133. 	printf("请输入员工的税款:>");
    134. 	scanf("%lf", &(ps->taxes));
    135. }
    136.  
    137. void AddSeqList(SeqList* ps, Employee temp)
    138. {
    139. 	CheckCapacity(ps);
    140. 	ps->emp[ps->size] = temp;
    141. 	ps->size++;
    142. 	printf("增加成功.\n");
    143. }
    144.  
    145.  
    146. int FindByName(SeqList* ps,char* name)
    147. {
    148. 	for (int i = 0; i < ps->size; i++)
    149. 	{
    150. 		if (strcmp(name, ps->emp[i].name) == 0)
    151. 		{
    152. 			return i;
    153. 		}
    154. 	}
    155. 	return -1;
    156. }
    157.  
    158. void DelSeqList(SeqList* ps)
    159. {
    160. 	if (ps->size == 0)
    161. 	{
    162. 		printf("当前员工总数为0，无法删除.\n");
    163. 	}
    164. 	char name[20] = { 0 };
    165. 	printf("请输入您要删除的员工信息的员工姓名:>");
    166. 	scanf("%s", name);
    167. 	int pos = FindByName(ps,name);
    168. 	if (pos == -1)
    169. 	{
    170. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    171. 		return;
    172. 	}
    173. 	else
    174. 	{
    175. 		int begin = pos + 1;
    176. 		while (begin < ps->size)
    177. 		{
    178. 			ps->emp[begin -1] = ps->emp[begin];
    179. 			begin++;
    180. 		}
    181. 		ps->size--;
    182. 	}
    183. 	printf("删除成功.\n");
    184. }
    185.  
    186. void SearByName(SeqList* ps)
    187. {
    188. 	char name[20] = { 0 };
    189. 	printf("请输入您要查询的员工信息的员工姓名:>");
    190. 	scanf("%s", name);
    191. 	int pos = FindByName(ps, name);
    192. 	if (pos == -1)
    193. 	{
    194. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    195. 		return;
    196. 	}
    197. 	else
    198. 	{
    199. 		printf("%-20s %-20s %-10s %-10s %-10s %-10s %-10s %-10s\n", "员工姓名", "员工工号", "基本工资", "奖金", "扣款", "应发工资", "税款", "实发工资");
    200. 		printf("%-20s %-20s %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf\n", \
    201. 			ps->emp[pos].name, ps->emp[pos].id, ps->emp[pos].InitWages, ps->emp[pos].bonus, ps->emp[pos].deduct, ps->emp[pos].NextWages, ps->emp[pos].taxes, ps->emp[pos].FinaWages);
    202. 	}
    203. }
    204.  
    205.  
    206.  
    207. void ModifySeqList(SeqList* ps)
    208. {
    209.  
    210. 	char name[20] = { 0 };
    211. 	printf("请输入您要修改的员工信息的员工姓名:>");
    212. 	scanf("%s", name);
    213. 	int pos = FindByName(ps, name);
    214. 	if (pos == -1)
    215. 	{
    216. 		printf("当前系统中不存在名字为%s的员工.\n", name);
    217. 		return;
    218. 	}
    219. 	char choice[20] = { 0 };
    220. rechoice:
    221. 	printf("请输入你要修改的信息项目名称");
    222. 	printf("(提示：您可选择输入员工工号，基本工资，奖金，扣款，税款):>");
    223. 	scanf("%s", choice);
    224. 	printf("请输入修改后的该信息项目值：>");
    225. 	if (strcmp(choice, "员工工号") == 0)
    226. 	{
    227. 		scanf("%s", ps->emp[pos].id);
    228. 	}
    229. 	else if (strcmp(choice, "基本工资") == 0)
    230. 	{
    231. 		scanf("%lf", &(ps->emp[pos].InitWages));
    232. 	}
    233. 	else if (strcmp(choice, "奖金") == 0)
    234. 	{
    235. 		scanf("%lf", &(ps->emp[pos].bonus));
    236. 	}
    237. 	else if (strcmp(choice, "扣款") == 0)
    238. 	{
    239. 		scanf("%lf", &(ps->emp[pos].deduct));
    240. 	}
    241. 	else if (strcmp(choice, "税款") == 0)
    242. 	{
    243. 		scanf("%lf", &(ps->emp[pos].taxes));
    244. 	}
    245. 	else
    246. 	{
    247. 		printf("请在提示中给出的选项中做出选择！\n");
    248. 		goto rechoice;
    249. 	}
    250. 	printf("修改成功.\n");
    251. }
    252.  
    253. void Swap(Employee* a, Employee* b)
    254. {
    255. 	Employee temp = *a;
    256. 	*a = *b;
    257. 	*b = temp;
    258. }
    259.  
    260.  
    261. void QsortByFinaWages(SeqList* ps, int begin, int end)
    262. {
    263. 	if (begin >= end)
    264. 	{
    265. 		return;
    266. 	}
    267. 	int keyi = begin;
    268. 	int left = begin, right = end;
    269. 	while (left < right)
    270. 	{
    271. 		while (left < right && ps->emp[right].FinaWages <= ps->emp[keyi].FinaWages)
    272. 		{
    273. 			right--;
    274. 		}
    275. 		while (left < right && ps->emp[left].FinaWages >= ps->emp[keyi].FinaWages)
    276. 		{
    277. 			left++;
    278. 		}
    279. 		Swap(&(ps->emp[left]), &(ps->emp[right]));
    280. 	}
    281. 	int meeti = left;
    282. 	Swap(&(ps->emp[keyi]), &(ps->emp[meeti]));
    283.  
    284. 	QsortByFinaWages(ps, begin, meeti - 1);
    285. 	QsortByFinaWages(ps, meeti+1, end);
    286. }
    287.  
    288. void ShellSortById(SeqList* ps)
    289. {
    290. 	int gap = ps->size;
    291. 	while (gap > 1)
    292. 	{
    293. 		gap = (gap / 3 + 1);
    294. 		for (int i = 0; i < ps->size - gap; i++)
    295. 		{
    296. 			int end = i;
    297. 			Employee temp = ps->emp[i + gap];
    298. 			while (end >= 0)
    299. 			{
    300. 				if (strcmp(ps->emp[end].id , temp.id)>0)
    301. 				{
    302. 					ps->emp[end + gap] = ps->emp[end];
    303. 					end -= gap;
    304. 				}
    305. 				else
    306. 				{
    307. 					break;
    308. 				}
    309. 			}
    310. 			ps->emp[end + gap] = temp;
    311. 			
    312. 		}
    313. 	}
    314. }
    315.  
    316.  
    317.  
    318. void CountSeqList(SeqList* ps)
    319. {
    320. 	for (int i = 0; i < ps->size; i++)
    321. 	{
    322. 		ps->emp[i].NextWages = ps->emp[i].InitWages + ps->emp[i].bonus - ps->emp[i].deduct;
    323. 		ps->emp[i].FinaWages = ps->emp[i].NextWages - ps->emp[i].taxes;
    324. 	}
    325.  
    326. }
    327.  
    328. void PrintSeqList(SeqList* ps)
    329. {
    330. 	printf("%-20s %-20s %-10s %-10s %-10s %-10s %-10s %-10s\n", "员工姓名", "员工工号", "基本工资", "奖金", "扣款", "应发工资","税款","实发工资");
    331. 	for (int i = 0; i < ps->size; i++)
    332. 	{
    333. 		printf("%-20s %-20s %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf %-10.2lf\n",\
    334. 			ps->emp[i].name,ps->emp[i].id, ps->emp[i].InitWages, ps->emp[i].bonus, ps->emp[i].deduct,ps->emp[i].NextWages,ps->emp[i].taxes,ps->emp[i].FinaWages);
    335. 	}
    336. }
    337.  
    338. int main()
    339. {
    340. 	int input = 0;
    341.  
    342. 	SeqList ST;
    343. 	InitSeqList(&ST);
    344.  
    345. 	do//先执行一次
    346. 	{
    347. 		Meau();
    348. 		printf("请输入您的选择(提示:请在0-9之间选择):>");
    349. 		scanf("%d", &input);
    350. 		switch (input)
    351. 		{
    352. 		case 0:
    353. 			printf("欢迎您的使用，即将退出程序.\n");
    354. 			SaveSeqList(&ST);
    355. 			break;
    356. 		case 1:
    357. 			printf("********增加工资信息.********\n");
    358. 			int nums = 0;
    359. 			printf("请输入您要增加的员工信息的员工数量:>");
    360. 			scanf("%d", &nums);
    361. 			Employee temp = { 0 };
    362. 			for (int i = 1; i <= nums; i++)
    363. 			{
    364. 				InitEmployee(&temp,i);
    365. 				AddSeqList(&ST,temp);
    366. 			}
    367. 			CountSeqList(&ST);
    368. 			break;
    369. 		case 2:
    370. 			printf("********删除工资信息.********\n");
    371. 			DelSeqList(&ST);
    372. 			break;
    373. 		case 3:
    374. 			printf("********查询工资信息.********\n");
    375. 			SearByName(&ST);
    376. 			break;
    377. 		case 4:
    378. 			printf("********修改工资信息.********\n");
    379. 			ModifySeqList(&ST);
    380. 			CountSeqList(&ST);
    381. 			break;
    382. 		case 5:
    383. 			printf("********按照工资排序.(从高到低)********\n");
    384. 			QsortByFinaWages(&ST,0,ST.size);
    385. 			PrintSeqList(&ST);
    386. 			break;
    387. 		case 6:
    388. 			printf("********按照工号排序.(从小到大)********\n");
    389. 			ShellSortById(&ST);
    390. 			PrintSeqList(&ST);
    391. 			break;
    392. 		case 7:
    393. 			printf("********计算员工工资********\n");
    394. 			CountSeqList(&ST);
    395. 			printf("计算成功.\n");
    396. 			break; 
    397. 		case 8:
    398. 			printf("********打印工资信息********\n");
    399. 			PrintSeqList(&ST);
    400. 			break;
    401. 		case 9:
    402. 			printf("********统计员工人数********\n");
    403. 			printf("当前系统人数:%d\n", ST.size);
    404. 		default:
    405. 			printf("********输入错误，请重新输入********\n");
    406. 			break;
    407. 		}
    408. 	} while (input);
    409. }

    17.效果预览图

     

    类似的,下面为学生信息管理系统 

    1. #define _CRT_SECURE_NO_WARNINGS 1
    2.  
    3. #include<stdio.h>
    4. #include<stdlib.h>
    5. #include<string.h>
    6.  
    7. typedef struct Student
    8. {
    9. 	char name[20];
    10. 	char id[20];
    11. 	float ChiScore;
    12. 	float MatScore;
    13. 	float EngScore;
    14. 	float SumScore;
    15. }Student;
    16.  
    17. typedef struct SeqList
    18. {
    19. 	Student* stu;
    20. 	int size;
    21. 	int capacity;
    22. }SeqList;
    23.  
    24.  
    25. void meau1(void)
    26. {
    27. 	printf("--------------------------------\n");
    28. 	printf("--- 欢迎使用学生信息管理系统 ---\n");
    29. 	printf("--------------------------------\n");
    30. 	printf("----     0.退出程序         ----\n");
    31. 	printf("----     1.录入学生信息     ----\n");
    32. 	printf("----     2.删除学生信息     ----\n");
    33. 	printf("----     3.查询指定课程     ----\n");
    34. 	printf("----     4.查询指定学生     ----\n");
    35. 	printf("----     5.修改学生信息     ----\n");
    36. 	printf("----     6.按照学号排序     ----\n");
    37. 	printf("----     7.按照总分排序     ----\n");
    38. 	printf("----     8.统计学生总数     ----\n");
    39. 	printf("----     9.打印学生信息     ----\n");
    40. 	printf("--------------------------------\n");
    41. }
    42.  
    43. //case -1 初始化： 初始化函数（3）
    44.  
    45. void CheckCapacity(SeqList* ps)
    46. {
    47. 	if (ps->size == ps->capacity)
    48. 	{
    49. 		int newcapacity = 2 * ps->capacity;
    50. 		Student* temp = (Student*)realloc(ps->stu, sizeof(Student) * newcapacity);
    51. 		if (temp == NULL)
    52. 		{
    53. 			perror("CheckCapacity::realloc:>");
    54. 			return;
    55. 		}
    56. 		ps->capacity = newcapacity;
    57. 		ps->stu = temp;
    58. 		printf("扩容成功.\n");
    59. 	}
    60. }
    61.  
    62. void LoadSeqList(SeqList* ps)
    63. {
    64. 	FILE* pf = fopen("D:\\桌面\\test.txt", "rb");
    65. 	if (pf == NULL)
    66. 	{
    67. 		perror("LoadSeqList::fopen:>");
    68. 		return;
    69. 	}
    70.  
    71. 	Student temp = { 0 };
    72. 	while (fread(&temp, sizeof(Student), 1, pf))
    73. 	{
    74. 		CheckCapacity(ps);
    75. 		ps->stu[ps->size] = temp;
    76. 		ps->size++;
    77. 	}
    78.  
    79. 	fclose(pf);
    80. 	pf = NULL;
    81. }
    82.  
    83. void InitSeqList(SeqList* ps)
    84. {
    85. 	ps->stu = (Student*)malloc(sizeof(Student) * 4);
    86. 	if (ps->stu == NULL)
    87. 	{
    88. 		perror("InitSeqList::malloc:>");
    89. 		return;
    90. 	}
    91. 	ps->capacity = 4;
    92. 	ps->size = 0;
    93.  
    94. 	LoadSeqList(ps);
    95. }
    96.  
    97. //case 0 退出程序:保存数据到文件函数(1)
    98.  
    99. void SaveSeqList(SeqList* ps)
    100. {
    101. 	FILE* pf = fopen("D:\\桌面\\test.txt", "wb");
    102. 	if (pf == NULL)
    103. 	{
    104. 		perror("LoadSeqList::fopen:>");
    105. 		return;
    106. 	}
    107.  
    108. 	for (int i = 0; i < ps->size; i++)
    109. 	{
    110. 		fwrite(ps->stu + i, sizeof(Student), 1, pf);
    111.     }
    112.  
    113. 	fclose(pf);
    114. 	pf = NULL;
    115. }
    116.  
    117.  
    118.  
    119. //case 1:录入学生信息 装配和插入函数(2)
    120.  
    121. void InitStudent(Student* ps,int i)
    122. {
    123. 	printf("请输入第%d个待录入的学生信息:\n", i);
    124.  
    125. 	printf("请输入学生的名字:>");
    126. 	scanf("%s", ps->name);
    127. 	printf("请输入学生的学号:>");
    128. 	scanf("%s", ps->id);
    129.  
    130. 	printf("请输入学生的语文成绩(0-100):>");
    131. 	scanf("%f", &(ps->ChiScore));
    132. 	printf("请输入学生的数学成绩(0-100):>");
    133. 	scanf("%f", &(ps->MatScore));
    134. 	printf("请输入学生的英语成绩(0-100):>");
    135. 	scanf("%f", &(ps->EngScore));
    136.  
    137. 	ps->SumScore = ps->ChiScore + ps->MatScore + ps->EngScore;
    138. }
    139.  
    140. void AddSeqList(SeqList* ps,Student temp)
    141. {
    142. 	CheckCapacity(ps);
    143. 	ps->stu[ps->size] = temp;
    144. 	ps->size++;
    145. }
    146.  
    147.  
    148.  
    149. //case 2：删除学生信息  菜单函数,定位和删除函数(4) 
    150.  
    151. void meau2(void)
    152. {
    153. 	printf("--  1.按照名字查找  --\n");
    154. 	printf("--  2.按照学号查找  --\n");
    155. }
    156.  
    157. //找得到返回下标，找不到返回-1
    158. int FindByName(SeqList* ps, const char* name)
    159. {
    160. 	for (int i = 0; i < ps->size; i++)
    161. 	{
    162. 		if (strcmp(ps->stu[i].name, name) == 0)
    163. 		{
    164. 			return i;
    165. 		}
    166. 	}
    167. 	return -1;
    168. }
    169.  
    170. int FindById(SeqList* ps, const char* id)
    171. {
    172. 	for (int i = 0; i < ps->size; i++)
    173. 	{
    174. 		if (strcmp(ps->stu[i].id, id) == 0)
    175. 		{
    176. 			return i;
    177. 		}
    178. 	}
    179. 	return -1;
    180. }
    181.  
    182. void DelSeqList(SeqList* ps)
    183. {
    184. 	if (ps->size == 0)
    185. 	{
    186. 		printf("当前学生总数为0，无法删除.\n");
    187. 		return;
    188. 	}
    189. 	meau2();
    190. 	int choice1 = 0;
    191. 	rechoice1:
    192. 	printf("请根据您要按何种方式查找到要删除的学生，输入相应的编号：>");
    193. 	scanf("%d", &choice1);
    194. 	int pos = 0;
    195. 	if (choice1 == 1)
    196. 	{
    197. 		char name[20] = { 0 };
    198. 		printf("请输入您要删除学生的学生姓名:>");
    199. 		scanf("%s", name);
    200. 		pos = FindByName(ps, name);
    201. 	}
    202. 	else if (choice1 == 2)
    203. 	{
    204. 		char id[20] = { 0 };
    205. 		printf("请输入您要删除学生的学生学号:>");
    206. 		scanf("%s", id);
    207. 		pos = FindById(ps, id);
    208. 	}
    209. 	else
    210. 	{
    211. 		printf("选择错误，请重新选择（提示：请在1-2中选择）.\n");
    212. 		goto rechoice1;
    213. 	}
    214.  
    215. 	if (pos == -1)
    216. 	{
    217. 		printf("您现在要删除的学生不存在当前学生信息管理系统中,请重新选择.\n");
    218. 		goto rechoice1;
    219. 	}
    220. 	else
    221. 	{
    222. 		int begin = pos + 1;
    223. 		while (begin < ps->size)
    224. 		{
    225. 			ps->stu[begin - 1] = ps->stu[begin];
    226. 			begin++;
    227. 		}
    228. 		ps->size--;
    229. 		printf("删除成功.\n");
    230. 	}
    231.  
    232. }
    233.  
    234.  
    235.  
    236. //case 3: 查询指定课程 菜单函数,定位和杂碎函数(10)
    237.  
    238. void meau3(void)
    239. {
    240. 	printf("--  1.语文  --\n");
    241. 	printf("--  2.数学  --\n");
    242. 	printf("--  3.英语  --\n");
    243. }
    244.  
    245. void Swap(char* buff1, char* buff2,int width)
    246. {
    247. 	while (width--)
    248. 	{
    249. 		char temp = *buff1;
    250. 		*buff1 = *buff2;
    251. 		*buff2 = temp;
    252. 		buff1++;
    253. 		buff2++;
    254. 	}
    255. }
    256.  
    257.  
    258. int cmp_struct_by_ChiScore(const void* e1, const void* e2)
    259. {
    260. 	return ((Student*)e2)->ChiScore - ((Student*)e1)->ChiScore;
    261. }
    262.  
    263. int cmp_struct_by_MatScore(const void* e1, const void* e2)
    264. {
    265. 	return ((Student*)e2)->MatScore - ((Student*)e1)->MatScore;
    266. }
    267.  
    268. int cmp_struct_by_EngScore(const void* e1, const void* e2)
    269. {
    270. 	return ((Student*)e2)->EngScore - ((Student*)e1)->EngScore;
    271. }
    272.  
    273. void BubbleSort(void* base, int size, int width, float (*cmp)(const void*, const void*))
    274. {
    275. 	int flag = 0;
    276. 	for (int i = 0; i < size - 1; i++)
    277. 	{
    278. 		for (int j = 0; j < size-1- i; j++)
    279. 		{
    280. 			if (cmp((char*)base + j * width, (char*)base + (j + 1) * width) > 0)
    281. 			{
    282. 				Swap((char*)base + j * width, (char*)base + (j + 1) * width, width);
    283. 				flag = 1;
    284. 			}
    285. 		}
    286. 		if (flag == 0)
    287. 		{
    288. 			break;
    289. 		}
    290. 	}
    291. }
    292.  
    293. void DisPlayByChiScore(SeqList* ps)
    294. {
    295. 	printf("%-20s %-20s %-20s %-20s\n", "姓名", "学号", "语文成绩", "语文成绩排名");
    296. 	for (int i = 0; i < ps->size; i++)
    297. 	{
    298. 		printf("%-20s %-20s %-20.2f %-20d\n", ps->stu[i].name, ps->stu[i].id, ps->stu[i].ChiScore, i + 1);
    299. 	}
    300. }
    301.  
    302. void DisPlayByMatScore(SeqList* ps)
    303. {
    304. 	printf("%-20s %-20s %-20s %-20s\n", "姓名", "学号", "数学成绩", "数学成绩排名");
    305. 	for (int i = 0; i < ps->size; i++)
    306. 	{
    307. 		printf("%-20s %-20s %-20.2f %-20d\n", ps->stu[i].name, ps->stu[i].id, ps->stu[i].MatScore, i + 1);
    308. 	}
    309. }
    310.  
    311. void DisPlayByEngScore(SeqList* ps)
    312. {
    313. 	printf("%-20s %-20s %-20s %-20s\n", "姓名", "学号", "英语成绩", "英语成绩排名");
    314. 	for (int i = 0; i < ps->size; i++)
    315. 	{
    316. 		printf("%-20s %-20s %-20.2f %-20d\n", ps->stu[i].name, ps->stu[i].id, ps->stu[i].EngScore, i + 1);
    317. 	}
    318. }
    319.  
    320. void SearByCourse(SeqList* ps)
    321. {
    322. 	if (ps->size == 0)
    323. 	{
    324. 		printf("当前学生总数为0，无法修改.\n");
    325. 		return;
    326. 	}
    327. 	meau3();
    328. 	int choice2 = 0;
    329. 	rechoice2:
    330. 	printf("请根据您要查询课程的名称，选择相应的编号:>");
    331. 	scanf("%d", &choice2);
    332. 	float sum = 0.00;
    333. 	int count1 = 0, count2 = 0;
    334. 	printf("\t\t***********查询课程结果***********\n\n");
    335. 	if (choice2 == 1)
    336. 	{
    337. 		for (int i = 0; i < ps->size; i++)
    338. 		{
    339. 			sum += ps->stu[i].ChiScore;
    340.  
    341. 			if (ps->stu[i].ChiScore < 60)
    342. 			{
    343. 				count1++;
    344. 			}
    345. 			else if (ps->stu[i].ChiScore < 90)
    346. 			{
    347. 				count2++;
    348. 			}
    349. 		}
    350. 		BubbleSort(ps->stu, ps->size, sizeof(Student), cmp_struct_by_ChiScore);
    351. 		DisPlayByChiScore(ps);
    352. 	}
    353. 	else if (choice2 == 2)
    354. 	{
    355. 		for (int i = 0; i < ps->size; i++)
    356. 		{
    357. 			sum += ps->stu[i].MatScore;
    358.  
    359. 			if (ps->stu[i].MatScore < 60)
    360. 			{
    361. 				count1++;
    362. 			}
    363. 			else if (ps->stu[i].MatScore < 90)
    364. 			{
    365. 				count2++;
    366. 			}
    367. 		}
    368. 		BubbleSort(ps->stu, ps->size, sizeof(Student), cmp_struct_by_MatScore);
    369. 		DisPlayByMatScore(ps);
    370. 	}
    371. 	else if (choice2 == 3)
    372. 	{
    373. 		for (int i = 0; i < ps->size; i++)
    374. 		{
    375. 			sum += ps->stu[i].EngScore;
    376.  
    377. 			if (ps->stu[i].EngScore < 60)
    378. 			{
    379. 				count1++;
    380. 			}
    381. 			else if (ps->stu[i].EngScore < 90)
    382. 			{
    383. 				count2++;
    384. 			}
    385. 		}
    386. 		BubbleSort(ps->stu, ps->size, sizeof(Student), cmp_struct_by_EngScore);
    387. 		DisPlayByEngScore(ps);
    388. 	}
    389. 	else
    390. 	{
    391. 		printf("选择错误，请重新选择（提示：请在1-3中选择）.\n");
    392. 		goto rechoice2;
    393. 	}
    394.  
    395. 	printf("\n\n% -20s % -20s % -20s % -20s % -20s\n", "不及格人数(0-60)", "及格人数(60-100)", "良好人数(60-90)", "优秀人数(90-100)","平均分");
    396. 	printf("%-20d %-20d %-20d %-20d %-20.2f\n", count1, ps->size - count1, count2, ps->size - count1 - count2, sum / ps->size);
    397.  
    398.  
    399. }
    400.  
    401.  
    402. //case 4:查询指定学生 
    403.  
    404. void SearByStudent(SeqList* ps)
    405. {
    406. 	if (ps->size == 0)
    407. 	{
    408. 		printf("当前学生总数为0，无法查询.\n");
    409. 		return;
    410. 	}
    411. 	meau2();
    412. 	int choice3 = 0;
    413. rechoice3:
    414. 	printf("请根据您要按何种方式查找学生，输入相应的编号：>");
    415. 	scanf("%d", &choice3);
    416. 	int pos = 0;
    417. 	if (choice3 == 1)
    418. 	{
    419. 		char name[20] = { 0 };
    420. 		printf("请输入您要查询学生的学生姓名:>");
    421. 		scanf("%s", name);
    422. 		pos = FindByName(ps, name);
    423. 	}
    424. 	else if (choice3 == 2)
    425. 	{
    426. 		char id[20] = { 0 };
    427. 		printf("请输入您要查询学生的学生学号:>");
    428. 		scanf("%s", id);
    429. 		pos = FindById(ps, id);
    430. 	}
    431. 	else
    432. 	{
    433. 		printf("选择错误，请重新选择（提示：请在1-2中选择）.\n");
    434. 		goto rechoice3;
    435. 	}
    436.  
    437. 	if (pos == -1)
    438. 	{
    439. 		printf("您现在要查询的学生不存在当前学生信息管理系统中,请重新选择.\n");
    440. 		goto rechoice3;
    441. 	}
    442. 	else
    443. 	{
    444. 		printf("\t\t***********查询学生结果***********\n");
    445. 		printf("%-20s %-20s %-20s %-20s %-20s %-20s %-20s\n","姓名","学号", "语文成绩", "数学成绩", "英语成绩", "总成绩", "总成绩排名");
    446. 		printf("%-20s %-20s %-20.2f %-20.2f %-20.2f %-20.2f %-20d\n", ps->stu[pos].name, ps->stu[pos].id, \
    447. 			ps->stu[pos].ChiScore, ps->stu[pos].MatScore, ps->stu[pos].EngScore, ps->stu[pos].SumScore, pos + 1);
    448. 	}
    449. }
    450.  
    451. //case 5: 修改学生成绩 -菜单函数和修改函数 -先找到这个学生，再进行修改
    452.  
    453. void ModSeqList(SeqList* ps)
    454. {
    455. 	if (ps->size == 0)
    456. 	{
    457. 		printf("当前学生总数为0，无法修改.\n");
    458. 		return;
    459. 	}
    460. 	meau2();
    461. 	int choice4 = 0;
    462. 	rechoice4:
    463. 	printf("请根据您要按何种方式查找到要修改的学生，输入相应的编号:>");
    464. 	scanf("%d", &choice4);
    465. 	int pos = 0;
    466. 	if (choice4 == 1)
    467. 	{
    468. 		char name[20] = { 0 };
    469. 		printf("请输入您要修改的学生信息的学生姓名:>");
    470. 		scanf("%s", name);
    471. 		pos = FindByName(ps, name);
    472. 	}
    473. 	else if (choice4 == 2)
    474. 	{
    475. 		char id[20] = { 0 };
    476. 		printf("请输入您要修改的学生信息的学生学号:>");
    477. 		scanf("%s", id);
    478. 		pos = FindById(ps, id);
    479. 	}
    480. 	else
    481. 	{
    482. 		printf("选择错误（提示：请在1-2中选择）.\n");
    483. 		goto rechoice4;
    484. 	}
    485.  
    486. 	if (pos == -1)
    487. 	{
    488. 		printf("您现在要查询的学生不存在当前学生信息管理系统中,请重新选择.\n");
    489. 		goto rechoice4;
    490. 	}
    491. 	else
    492. 	{
    493. 		meau3();
    494. 		int input = 0;
    495. 		again:
    496. 		printf("请根据您要修改的课程成绩的课程名称，选择相应的编号:>");
    497. 		scanf("%d", &input);
    498. 		printf("请输入修改后的值:>");
    499. 		if (input == 1)
    500. 		{
    501. 			scanf("%f", &(ps->stu[pos].ChiScore));
    502. 		}
    503. 		else if (input == 2)
    504. 		{
    505. 			scanf("%f", &(ps->stu[pos].EngScore));
    506. 		}
    507. 		else if (input == 3)
    508. 		{
    509. 			scanf("%f", &(ps->stu[pos].EngScore));
    510. 		}
    511. 		else
    512. 		{
    513. 			printf("选择错误，请重新选择 （提示：请在1-3中选择):>");
    514. 			goto again;
    515. 		}
    516. 		printf("修改成功.\n");
    517. 	}
    518. }
    519.  
    520. //case 6: 按照学号排序 -排升序
    521.  
    522. void Swap2(Student* s1, Student* s2)
    523. {
    524. 	Student temp = *s1;
    525. 	*s1 = *s2;
    526. 	*s2 = temp;
    527. }
    528.  
    529. void QsortById(SeqList* ps, int begin, int end)
    530. {
    531. 	if (begin >= end)
    532. 	{
    533. 		return;
    534. 	}
    535. 	int keyi = begin;
    536. 	int left = begin, right = end;
    537. 	while (left < right)
    538. 	{
    539. 		while (left < right && strcmp(ps->stu[right].id, ps->stu[keyi].id)>0)
    540. 		{
    541. 			right--;
    542. 		}
    543. 		while (left < right && strcmp(ps->stu[left].id, ps->stu[keyi].id) <= 0)
    544. 		{
    545. 			left++;
    546. 		}
    547. 		Swap2(&(ps->stu[left]), &(ps->stu[right]));
    548. 	}
    549. 	int meeti = left;
    550. 	Swap2(&(ps->stu[meeti]), &(ps->stu[keyi]));
    551. 	QsortById(ps, begin, meeti - 1);
    552. 	QsortById(ps, meeti + 1, end);
    553. }
    554.  
    555. //case 7: 按照总成绩排序-排降序
    556.  
    557. void ShellSortBySumScore(SeqList* ps)
    558. {
    559. 	int gap = ps->size;
    560. 	while (gap > 1)
    561. 	{
    562. 		gap = (gap / 3 + 1);
    563. 		for (int i = 0; i < ps->size - gap; i++)
    564. 		{
    565. 			int end = i;
    566. 			Student temp = ps->stu[end + gap];
    567. 			while (end >= 0)
    568. 			{
    569. 				if (temp.SumScore > ps->stu[end].SumScore)
    570. 				{
    571. 					ps->stu[end + gap] = ps->stu[end];
    572. 					end--;
    573. 				}
    574. 				else
    575. 				{
    576. 					break;
    577. 				}
    578. 			}
    579. 			ps->stu[end + gap] = temp;
    580. 		}
    581. 	}
    582. }
    583.  
    584. //case 9: 打印学生信息
    585.  
    586. void PrintSeqList(SeqList* ps)
    587. {
    588. 	if (ps->size == 0)
    589. 	{
    590. 		printf("当前学生总数为0，无法打印.\n");
    591. 		return;
    592. 	}
    593. 	printf("%-20s %-20s %-20s %-20s %-20s %-20s %-20s\n", "姓名", "学号", "语文成绩", "数学成绩", "英语成绩", "总成绩", "排名");
    594.  
    595. 	for (int i = 0; i < ps->size; i++)
    596. 	{
    597. 		printf("%-20s %-20s %-20.2f %-20.2f %-20.2f %-20.2f %-20d\n", ps->stu[i].name, ps->stu[i].id, \
    598. 			ps->stu[i].ChiScore, ps->stu[i].MatScore, ps->stu[i].EngScore, ps->stu[i].SumScore, i+1);
    599. 	}
    600. }
    601.  
    602. int main()
    603. {
    604. 	SeqList ST;
    605. 	InitSeqList(&ST);
    606.  
    607. 	int input = 0;
    608.  
    609. 	do
    610. 	{
    611. 		meau1();
    612. 		printf("请输入您的选择(提示:只能在0-9之间做选择):>");
    613. 		scanf("%d", &input);
    614.  
    615. 		switch (input)
    616. 		{
    617. 		case 0:
    618. 			printf("\t******感谢您的使用，即将退出程序******\n");
    619. 			SaveSeqList(&ST);
    620. 			break;
    621.  
    622. 		case 1:
    623. 			printf("\t******录入学生信息******\n");
    624. 			int nums = 0;
    625. 			printf("请输入您要录入的学生个数:>");
    626. 			scanf("%d", &nums);
    627.  
    628. 			Student temp = { 0 };
    629. 			for (int i = 1; i <= nums; i++)
    630. 			{
    631. 				InitStudent(&temp, i);
    632. 				AddSeqList(&ST, temp);
    633. 			}
    634. 			printf("录入成功.\n");
    635. 			break;
    636.  
    637. 		case 2:
    638. 			printf("\t******删除学生信息******\n");
    639. 			DelSeqList(&ST);
    640. 			break;
    641.  
    642. 		case 3:
    643. 			printf("\t******查询指定课程******\n");
    644. 			SearByCourse(&ST);
    645. 			break;
    646.  
    647. 		case 4:
    648. 			printf("\t******查询指定学生******\n");
    649. 			SearByStudent(&ST);
    650. 			break;
    651.  
    652. 		case 5:
    653. 			printf("\t******修改学生信息******\n");
    654. 			ModSeqList(&ST);
    655. 			break;
    656.  
    657. 		case 6:
    658. 			printf("\t******按照学号排序 (由小到大）******\n");
    659. 			QsortById(&ST, 0, ST.size);
    660. 			PrintSeqList(&ST);
    661. 			break;
    662.  
    663. 		case 7:
    664. 			printf("\t******按照总分排序 （由高到低）******\n");
    665. 			ShellSortBySumScore(&ST);
    666. 			PrintSeqList(&ST);
    667. 			break;
    668.  
    669. 		case 8:
    670. 			printf("\t******统计学生总数******\n");
    671. 			printf("当前学生总数:%d\n", ST.size);
    672. 			break;
    673.  
    674. 		case 9:
    675. 			printf("\t******打印学生信息******\n");
    676. 			PrintSeqList(&ST);
    677. 			break;
    678.  
    679. 		default:
    680. 			printf("选择错误,请重新选择(提示:请在0-9中选择):>");
    681. 			break;
    682. 		}
    683. 	} while (input);
    684. }
    685.

  • 相关阅读:
    【漏洞复现】weblogic-10.3.6-‘wls-wsat‘-XMLDecoder反序列化(CVE-2017-10271)
    [附源码]计算机毕业设计JAVA疫苗接种管理系统
    邀请加入团队
    使用docker安装elasticsearch 7.4.2
    点云的区域增长聚类算法 （附open3d python代码）
    【Linux】nohub指令--终端退出后命令仍旧执行
    11.27学术报告听讲笔记
    【51单片机】DS18B20（江科大）
    内部类_Java
    使用RabbitMq实现延时队列
  • 原文地址：https://blog.csdn.net/qq_64428099/article/details/125381809