員工管理系統(tǒng)數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)

1、/*Linklist.h*/#include"stdio.h"#include"stdlib.h"#include "string.h"#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define OVERFLOW -2typedef struct LNodechar id20;char name10;char sex10;char birth10;char edu10;char duty10;char phone20;char address30;struct LNo

2、de *next;LNode,*Linklist;/定義節(jié)點(diǎn)類型int CreatList(Linklist &L)Linklist p;p=(Linklist)malloc(sizeof(LNode);if(!p)return (0);elseprintf("請輸入員工編號n");scanf("%s",p->id); printf("請輸入員工姓名n");scanf("%s",p->name); printf("請輸入員工性別n"); scanf("%s"

3、;,p->sex); printf("請輸入員工生日n");scanf("%s",p->birth); printf("請輸入員工學(xué)歷n"); scanf("%s",p->edu); printf("請輸入員工職務(wù)n");scanf("%s",p->duty);printf("請輸入員工電話n");scanf("%s",p->phone); printf("請輸入員工地址n");scan

4、f("%s",p->address);p->next=L->next;L->next=p;/頭插法生成單鏈表int Initlist(Linklist &L)L=(Linklist)malloc(sizeof(LNode);if(!L)return (0);L->next=NULL;return OK;/初始化單鏈表void Display(Linklist &L)Linklist p;for(p=L->next;p;p=p->next)printf("編號 %sn",p->id);prin

5、tf("姓名 %sn",p->name);printf("性別 %sn",p->sex);printf("生日 %sn",p->birth);printf("學(xué)歷 %sn",p->edu);printf("職務(wù) %sn",p->duty);printf("電話 %sn",p->phone);printf("地址 %sn",p->address); printf("=n");/顯示所有員工信息in

6、t SearchID(Linklist &L,char id20)LNode *p;p=L;while(p)if(strcmp(p->id,id)=0)printf("編號 %sn",p->id);printf("姓名 %sn",p->name);printf("性別 %sn",p->sex);printf("生日 %sn",p->birth);printf("學(xué)歷 %sn",p->edu);printf("職務(wù) %sn",p-&g

7、t;duty);printf("電話 %sn",p->phone);printf("地址 %sn",p->address);p=p->next;return OK;/ID查詢int SearchName(Linklist &L,char name10)LNode *p;p=L;while(p)if(strcmp(p->name,name)=0)printf("編號 %sn",p->id);printf("姓名 %sn",p->name);printf("性別 %

8、sn",p->sex);printf("生日 %sn",p->birth);printf("學(xué)歷 %sn",p->edu);printf("職務(wù) %sn",p->duty);printf("電話 %sn",p->phone);printf("地址 %sn",p->address);p=p->next;return OK;/姓名查詢void SortID(Linklist &L ,char id20) Linklist La;Linkli

9、st p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->id,q->id )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->n

10、ext ;La->next =q ;L=La;Display(L);/編號排序void SortName(Linklist &L ,char name10) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->name,q->name )>0 )m=p;q=p-

11、>next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/姓名排序void SortSex(Linklist &L ,char sex10) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L-&g

12、t;next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->sex,q->sex)>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/性別排序void SortBirth(Linklist &L ,char birth10) L

13、inklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->birth,q->birth )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->nex

14、t ;q->next =La->next ;La->next =q ;L=La;Display(L);/出生年月排序void SortEdu(Linklist &L ,char edu10) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->edu,q->

15、;edu )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/學(xué)歷排序void SortDuty(Linklist &L ,char duty10) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while

16、(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->duty,q->duty )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/職務(wù)排序void SortPhone(Linkli

17、st &L ,char phone20) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(strcmp( p->next->phone,q->phone )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next

18、;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/電話排序void SortAddress(Linklist &L ,char address30) Linklist La;Linklist p,q,m; La=(Linklist)malloc(sizeof(LNode);La->next =NULL;while(L->next) for(q=L->next ,p=L->next ;p->next ;p=p->next )if(

19、strcmp( p->next->address,q->address )>0 )m=p;q=p->next ; if(q=L->next)L->next =L->next->next ;elsem->next =q->next ;q->next =La->next ;La->next =q ;L=La;Display(L);/地址排序int Alter(Linklist &L,char id20)LNode *p;p=L;while(p)if(strcmp(p->id,id)=0)printf(

20、"請輸入員工編號n");scanf("%s",p->id); printf("請輸入員工姓名n");scanf("%s",p->name);printf("請輸入員工性別n");scanf("%s",p->sex);printf("請輸入員工生日n");scanf("%s",p->birth);printf("請輸入員工學(xué)歷n");scanf("%s",p->edu)

21、;printf("請輸入員工職務(wù)n");scanf("%s",p->duty);printf("請輸入員工電話n");scanf("%s",p->phone);printf("請輸入員工地址n");scanf("%s",p->address);p=p->next;return OK;/更改int Del(Linklist &L,char id20)LNode *p;LNode *r;p=L->next;r=L;while(!(strcmp

22、(p->id,id)=0)&&p)r=p;p=p->next;if(!p)printf("n刪除位置不合理n");elser->next=p->next; free(p);printf("刪除成功n");return OK;/按ID刪除/主函數(shù)void main()Linklist L;int a;char m;char name10; char id20; char sex10;char birth10;char edu10;char duty10;char phone20;char address30;Init

23、list(L);int y;int x=1;while(x)printf("*n");printf("歡迎進(jìn)入員工管理系統(tǒng)！n");printf("*n");printf("1-添加員工信息n");printf("2-查詢員工信息n");printf("3-排序員工信息n");printf("4-顯示所有員工信息n");printf("5-更改員工信息n");printf("6-刪除員工信息n");printf(&q

24、uot;7-退出n");printf("*n");printf("請選擇操作序號并按回車:");scanf("%d",&y);switch(y)case 1: CreatList(L);doprintf("是否繼續(xù)輸入?(y/n)");getchar();scanf("%c",&m);if(m='y')CreatList(L);while(m!='n');break;case 2: printf("請輸入查詢方式(1按編號查詢,2按姓名查找)");scanf("%d",&a);if(a=1)printf("請輸入查詢員工編號n");scanf("%s",&id);SearchID(L,id);if(a=2)printf("請輸入查詢員工姓名n");sca