本文实例为大家分享了C语言学生信息管理系统的具体代码，供大家参考，具体内容如下
代码：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
|
//以单链表作为存储结构，设计和实现课程成绩管理的完整程序。//程序包括如下功能。 //1.建立学生成绩表，包含学生的学号、姓名和成绩。 //2.可以显示所有学生成绩。 //3.可以计算学生的总数。 //4.可以按学号和序号查找学生。 //5.可以在指定位置插入学生成绩数据。 //6.可以删除指定位置的学生数据。 //7.可以把学生成绩按从高到低的顺序排序。 //作者： yinlinqvan //操作系统：Mac OS X //编译器：gcc #include "string.h" #include "sys/malloc.h" #include "stdlib.h" #include "stdio.h" #include "time.h" #include "sys/types.h" #define MAXSIZE 100 typedef struct Student { char sname[9]; char sno[5]; int score; }DataType; typedef struct{ DataType data; struct Node *next; }LinkList; LinkList * inputdata(); void display(LinkList * p); //遍历链表 void displayAll(LinkList * L); //插入 LinkList * createTailList();//尾插 LinkList * createHeadList();//头插 //查询 void getElem(LinkList * L, int i);//按序号 void locateElemBysno(LinkList * L, char ch[]);//按值 void locateElemBysname(LinkList * L, char ch[]); int lengthList(LinkList * L); //插入 void insertElem(LinkList * L, int i);//在第i个结点前进行插入 void insertElemBysno(LinkList * L, char ch[5]);//按学号 void deleteElem(LinkList * L, char ch[]); //排序 void insertSort(LinkList * L); int menue(); int main(int argc,char *argv[]) { LinkList *L; char sno[5] = {'\0'}; char sname[9] = {'\0'}; int b = 1; int i = 1; while (b) { switch(menue()) { case 1: L = createTailList(); //L = createHeadList(); break; case 2: //displayAll(L); printf("\t◎输入插入哪个位置前："); scanf("%d", &i); insertElem(L, i); //scanf("%s", sno); //insertElemBysno(L, sno); break; case 3: printf("\t◎输入待删除学生的学号："); scanf("%s", sno); deleteElem(L, sno); break; case 4: printf("╭═══════════════════════════════╮\n"); printf("║\t学生总数为：%d\t\t║\n", lengthList(L)); printf("╰═══════════════════════════════╯\n\n"); break; case 5: printf("\t◎输入待查找学生的学号："); scanf("%s", sno); locateElemBysno(L, sno); break; case 6: printf("\t◎输入待查学生的位置："); scanf("%d", &i); getElem(L, i); break; case 7: displayAll(L); break; case 8: insertSort(L); break; case 9: i = 2; while (i) { system("clear"); printf("\033[5m"); printf("\033[?25l"); //隐藏光标 printf("\n\n\n\n\n\n"); printf("╭═══════════════════════════════╮\n"); printf("║\t正在退出(%d秒)\t\t║\n", i--); printf("╰═══════════════════════════════╯\n"); sleep(1); } printf("\033[0m"); system("clear"); return 0; break; default: i = 2; while (i) { system("clear"); printf("╭═══════════════════════════════╮\n"); printf("║操作数无效，正在返回主菜单(%d秒)║\n", i--); printf("╰═══════════════════════════════╯\n"); sleep(1); } continue; } getchar(); printf("PRESS ENTER TO CONTINUE!"); while (1) { if ('\n' == getchar()) { break; } } } return 0; } int menue() { system("clear"); //警告音 printf("\033[0m"); //关闭所有属性 printf("\033[44;37m"); //47是字背景颜色,33是字体的颜色 printf ("\033[5m"); //闪烁 printf("\n^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^\n\n"); printf("\033[0m"); //关闭所有属性 printf("\033[44;37m"); printf("╭═══════════════════════════════╮\n"); printf("║\t学生成绩管理程序\t║\n"); printf("║\t\t\t\t║\n"); printf("║\t<1>创建\t\t\t║\n"); printf("║\t<2>指定位置后插入\t║\n"); printf("║\t<3>按位置删除\t\t║\n"); printf("║\t<4>求学生总数\t\t║\n"); printf("║\t<5>按学号查找\t\t║\n"); printf("║\t<6>按位置查找\t\t║\n"); printf("║\t<7>显示所有学生\t\t║\n"); printf("║\t<8>成绩排序\t\t║\n"); printf("║\t<9>退出\t\t\t║\n"); printf("╰═══════════════════════════════╯\n\n"); printf ("\033[5m"); printf("^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^\n\n"); printf("\033[0m"); //关闭所有属性 time_t rawtime; struct tm * timeinfo; time ( &rawtime ); timeinfo = localtime ( &rawtime ); //printf ( "\t\007%s", asctime (timeinfo) ); printf ("\033[;34m"); printf ("\t[%4d-%02d-%02d %02d:%02d:%02d]\n", 1900+timeinfo->tm_year, 1+timeinfo->tm_mon, timeinfo->tm_mday, timeinfo->tm_hour, timeinfo->tm_min, timeinfo->tm_sec); char colorname[3][20] = {{"RED"}, {"BLUE"}, {"YELLLOW"}}; srand(time(&rawtime)); //时间触发 //textcolor(colorname[rand()%3]); //printf("\t[textcolor is %s]\n", colorname[rand()%3]); //颜色码和控制码 我的参考链接 http://wenku.baidu.com/view/a38f77ff910ef12d2af9e70b.html printf("\t◎输入功能项："); int a = 0; scanf("%d",&a); printf("\033[0m"); system("clear"); return a; } LinkList * inputdata() { LinkList *s = NULL; char sno[5] = {'\0'}; char sname[9] = {'\0'}; int score = 0; printf("\tsno\t->"); scanf("%s", sno); if (sno[0] == '#') { return s; } s = (LinkList *)malloc(sizeof(LinkList)); strcpy(s -> data.sno, sno); printf("\tsname\t->"); scanf("%s", sname); strcpy(s -> data.sname, sname); printf("\tscore\t->"); scanf("%d", &score); s -> data.score = score; printf("\n"); return s; } void display(LinkList * p) { printf("╭═══════════════════════════════════════════════╮\n"); printf("║\tsno\t\tsname\t\tscore\t║\n"); printf("║\t%s\t\t%s\t\t%-4d\t║\n", p->data.sno, p->data.sname, p->data.score); printf("╰═══════════════════════════════════════════════╯\n\n");} void displayAll(LinkList * L) { printf("╭═══════════════════════════════════════════════╮\n"); printf("║\tsno\t\tsname\t\tscore\t║\n"); LinkList * p = L -> next; while(p) { printf("║\t%s\t\t%s\t\t%-4d\t║\n", p->data.sno, p->data.sname, p->data.score); p = p -> next; } printf("╰═══════════════════════════════════════════════╯\n\n"); } LinkList * createTailList() { //链表头结点 LinkList * L = (LinkList *)malloc(sizeof(LinkList)); //结点 LinkList * s = NULL; //尾结点 LinkList * r = L; printf("╭═══════════════════════════════════════════════╮\n"); printf("║\t\t尾插法建立\t\t\t║\n"); printf("║\t请输入学生信息（当学号为\"#\"时结束）\t║\n"); printf("║\t\t\t\t\t\t║\n"); printf("║\t学号sno （不超过4位）\t\t║\n"); printf("║\t姓名sname （不超过4个汉字）\t\t║\n"); printf("║\t成绩score （int型）\t\t\t║\n"); printf("╰═══════════════════════════════════════════════╯\n\n"); while (1) { s = inputdata(); if (!s) { break; } r->next = s; r = s; } r->next = NULL; return L; } LinkList * createHeadList() { //链表头结点 LinkList * L = (LinkList *)malloc(sizeof(LinkList)); //结点 LinkList * s = NULL; printf("╭═══════════════════════════════════════════════╮\n"); printf("║\t\t头插法建立\t\t║\n"); printf("║\t请输入学生信息（当学号为\"#\"时结束）\t║\n"); printf("║\t\t\t\t\t\t║\n"); printf("║\t学号sno （不超过4位）\t\t║\n"); printf("║\t姓名sname （不超过4个汉字）\t\t║\n"); printf("║\t成绩score （int型）\t\t\t║\n"); printf("╰═══════════════════════════════════════════════╯\n\n"); while (1) { s = inputdata(); if (!s) { break; } s->next = L->next; L->next = s; } return L; } void getElem(LinkList * L, int i) { LinkList * p = L; int j = 0; while (p && j<i) { p = p->next; j++; } if (!p) { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } else { display(p); } } void locateElemBysno(LinkList * L, char ch[5]) { LinkList * p = L->next; while (p && (0 != strcmp(p->data.sno, ch))) { p = p -> next; } if (!p) { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } else { display(p); } } void locateElemBysname(LinkList * L, char ch[9]) { LinkList * p = L->next; while (p && (0 != strcmp(p->data.sname, ch))) { p = p -> next; } if (!p) { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } else { display(p); } } int lengthList(LinkList * L) { LinkList * p = L->next; int j = 0; while (p) { p = p->next; j ++; } return j; } void insertElem(LinkList * L, int i) { LinkList * s = inputdata(); LinkList * p = L; int j = 0; while (p && j<i-1) { p = p->next; j++; } if (p && p->next) { s->next = p->next; p->next = s; } else { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } displayAll(L); } void insertElemBysno(LinkList * L, char ch[5]) { LinkList * p = L; LinkList * s = NULL; while (p && (0 != strcmp(p->data.sno, ch))) { p = p->next; } if (!p) { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } else { s = inputdata(); s->next = p->next; p->next = s; } } void deleteElem(LinkList * L, char ch[5]) { LinkList *p, *q; p = L->next; q=L; while (p && (strcmp(p->data.sno, ch) != 0)) { q = p; p = p->next; } if (!p) { printf("╭═══════════════════════════════╮\n"); printf("║\tDon't find the student!\t║\n"); printf("╰═══════════════════════════════╯\n\n"); } else { display(p); q->next = p->next; free(p); } } void insertSort(LinkList * L) { LinkList * L1; LinkList * p; LinkList * q; LinkList * s; int len; len = lengthList(L); L1 = (LinkList *)malloc(sizeof(LinkList)); if (L->next) { s = (LinkList *)malloc(sizeof(LinkList)); strcpy(s->data.sno, L->data.sno); strcpy(s->data.sname, L->data.sname); s->data.score = L->data.score; s->next = NULL; L1->next = s; q = L->next; } else { printf("╭═══════════════════════════════════╮\n"); printf("║\tThe student link list is empty!\n║\n"); printf("╰═══════════════════════════════════╯\n\n"); return; } while (q) { p = L1->next; while (p &&(p->data.score >= q->data.score)) { p = p->next; } s = (LinkList *)malloc(sizeof(LinkList)); strcpy(s->data.sno, q->data.sno); strcpy(s->data.sname, q->data.sname); s->data.score = q->data.score; if (!p) { s->next = NULL; p->next = s; } else { s->next = p->next; p->next = s; } q = q->next; } displayAll(L1); } |
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：http://blog.csdn.net/yinlinqvan/article/details/12951735
