计算机软件课设报告

数据结构实验报告030910337 徐大生（一）实验对象、目的和要求1.合并顺序表实现两个顺序表的合并，将共同拥有的元素只存其一。

2.顺序表实现顺序表的定义、创建、插入和删除操作，将数据元素显示出来。

3.单链表实现单链表的定义、创建、插入和删除操作，将数据元素显示出来。

4.顺序栈实现顺序栈的定义、创建、插入和删除操作，将数据元素显示出来。

5.链栈实现链栈的定义、创建、插入和删除操作，将数据元素显示出来。

6.顺序队实现顺序队的定义、创建、插入和删除操作，将数据元素显示出来。

7.链队实现链队的定义、创建、插入和删除操作，将数据元素显示出来。

8.二叉树二叉树的链式存储结构的数据结构定义、创建、先序/中序/后序遍历，并将结果序列输出。

9.图图的邻接表和邻接矩阵数据结构的定义、创建；图的深度优先遍历、广度优先遍历。

10.查找顺序查找、二分查找。

11.排序插入排序、选择排序、冒泡排序。

12.通讯录的制作12.1通讯录设计目的：运用〈数据结构〉中的算法思想作数据结构，结合C语言基本知识，编写一个通讯录管理系统。

以把所学数据结构知识应用到实际软件开发中去。

通过完成本课题，进一步熟悉C语言的基本知识，并掌握数据结构的一些基本算法思想，掌握C语言的文件操作（包括从磁盘读入和向磁盘写入内容），进一步熟悉指针的用法，数组的建立运用和函数的调用等。

12.2通讯录设计内容：本系统应完成以下几方面的功能：①输入信息（Enter()）: 调用此函数用以输入数据到内存中，此过程包括建立相应的链表或相应的数组，便于读取②显示信息（Display()）:用以显示输入的数据，包括从内存中读出和从磁盘中读出③查找（Search()）:以姓名作为关键字查找要找的信息④删除信息（Delete()）:用以删除选定的输入信息（姓名作为关键字）⑤存盘（Save()）:调用此函数将内存中的数据保存至磁盘中⑥装入（Load()）:调用此函数用以将之前保存在磁盘的内容读入到内存中或显示到屏幕上注：本课题中输入的数据应包括以下几项信息：姓名（NAME ）学校（SCHOOL）城市（CITY）邮编（EIP）国家（STATE）（二）程序流程图1.顺序表合并2.顺序表3.链表4.顺序栈5.链栈6.顺序队7.链队8.二叉树9.图10.查找10.1顺序查找10.2二分查找11.排序11.1插入排序11.2选择排序11.3冒泡排序通讯录12.链栈（三）源程序清单1.合并顺序表#include<stdio.h>#include<string.h>#include<stdlib.h>#define SeqList struct listtype#define MaxSize 1000SeqList{int data[MaxSize];int last;};void merge(SeqList *p,SeqList *q,SeqList *c){int i,j,k,a;i=0;j=0;k=0;while(i<=p->last){c->data[k]=p->data[i];k++;i++;}while(j<=q->last){i=0;while(i<=p->last&&p->data[i]!=q->data[j])i++;if(i>p->last){c->data[k]=q->data[j];k++;}j++;}for(a=0;a<k;a++)printf("%d ",c->data[a]);}SeqList *init_SeqList(){SeqList *p;p=(SeqList*)malloc(sizeof(SeqList));p->last=-1;return p;}void main(){SeqList *p;p=init_SeqList();int i,j;i=0;j=0;printf("Please input SeqListp:\n");scanf("%d",&p->data[i]);while(p->data[i]!=-1){i++;scanf("%d",&p->data[i]);p->last++;}SeqList *q;q=init_SeqList();printf("Please input SeqListq:\n");scanf("%d",&q->data[j]);while(q->data[j]!=-1){j++;scanf("%d",&q->data[j]);q->last++;}SeqList *c;c=init_SeqList();merge(p,q,c);}2.顺序表#include<stdio.h>#include<stdlib.h>#define seqlist struct listtype#define maxsize 1000seqlist{int data[maxsize];int last;};seqlist *init_seqlist() //初始化{seqlist *L;L=(seqlist*)malloc(sizeof(seqlist) );L->last=-1;return L;}int insert_seqlist(seqlist *L,int i,int x) //插入{int j;if(L->last==maxsize-1){printf("The seqlist isfull.\n");return -1;}if(i==L->last+1)L->data[L->last+1]=x;else{for(j=L->last;j>=i;j--)L->data[j+1]=L->data[j];L->data[i]=x;}L->last++;return 1;}int Delete_seqlist(seqlist *L,int b) //删除{int j;if(b<0||b>L->last){printf("b is invalid!\n");return(0);}for(j=b;j<=L->last-1;j++)L->data[j]=L->data[j+1];L->last--;return(1);}void main(){seqlist *L;L=init_seqlist();int i,j,a,x,p,b;i=0;j=0;printf("Please input SeqListL:\n");scanf("%d",&p);while(p!=-1) //出现-1时结束创建顺序表{L->data[i]=p;i++;L->last++;scanf("%d",&p);}printf("please input the numberto insert:a= ;x= .\n");scanf("%d",&a);scanf("%d",&x);if(insert_seqlist(L,a,x)){printf("The seqlist after insert is:\n");for(i=0;i<=L->last;i++)printf("%d\n",L->data[i]);}printf("please input the number to delete:b= \n");scanf("%d",&b);if(Delete_seqlist(L,b)){printf("The seqlist after deletion is:\n");for(i=0;i<=L->last;i++)printf("%d\n",L->data[i]);}}3.单链表#include<stdio.h>#include<stdlib.h>#define NULL 0#define SLNODE struct nodeSLNODE{int data;SLNODE *next;};int Del_LinkList(SLNODE *h,int i){SLNODE *p,*s;int j;p=h;j=0;while(p->next!=NULL&&j<i-1){p=p->next;j++;}if(j!=i-1){printf("i is invalid!\n");return 0;}else{if(p->next==NULL){printf("i does not exist!\n");return(0);}else{s=p->next;p->next=s->next;free(s);return(1);}}}SLNODE *CREATE_SL(SLNODE *h){SLNODE *p,*s;int x;h=(SLNODE*)malloc(sizeof(SLNODE));p=h;h->next=NULL;printf("please input element:\n");scanf("%d",&x);while(x!=-1){s=(SLNODE*)malloc(sizeof(SLNODE));s->data=x;if(h->next==NULL)h->next=s;elsep->next=s;p=s;scanf("%d",&x);}p->next=NULL;return h;}void main(){SLNODE *h,*p;int i;h=CREATE_SL(h);printf("The original linklistis:\n");for(p=h->next;p!=NULL;p=p->next)printf("%d\n",p->data);printf("please input the numder i to delet:i=\n");scanf("%d",&i);if(Del_LinkList(h,i)){printf("The linklist afer deletion is:\n");for(p=h->next;p!=NULL;p=p->next)printf("%d\n",p->data);}}4.顺序栈#include<stdio.h>#include<stdlib.h>#define maxsize 1024typedef struct stack{int data[maxsize];int top;}sqstack;sqstack *init_seqstack(){sqstack *s;s=(sqstack*)malloc(sizeof(sqstack));s->top=-1;return s;}int Pop_seqstack(sqstack *s,int x){if(s->top==-1)return 0;else{x=s->data[s->top];s->top--;return 1;}}int Top_seqstack(sqstack *s){if(s->top==-1)return 0;elsereturn(s->data[s->top]);}int Push_seqstack(sqstack *s,int x){if(s->top==maxsize-1)return 0;else{s->top++;s->data[s->top]=x;return(1);}}void main(){int a;int b;sqstack *s;s=init_seqstack();printf("please input the element of seqstack s:a= \n");scanf("%d",&a);while(a!=-1){if(Push_seqstack(s,a))scanf("%d",&a);}printf("The top element after push is:\n");printf("%d\n",Top_seqstack(s));if(Pop_seqstack(s,b)){printf("The top element after pop is:\n");printf("%d\n",Top_seqstack(s));}}5.链栈#include<stdio.h>#include<stdlib.h>#define Linkstack struct linkstack#define NULL 0int b;Linkstack{int data;Linkstack *next;};Linkstack *init_Linkstack(){Linkstack *top;top=(Linkstack*)malloc(sizeof(Li nkstack));top=NULL;return top;}Linkstack *Push_Linkstack(Linkstack *top,int x){Linkstack *s;s=(Linkstack*)malloc(sizeof(Link stack));s->data=x;s->next=top;top=s;return top;}Linkstack *Pop_Linkstack(Linkstack *top){Linkstack *p;if(top==NULL)return NULL;else{b=top->data;p=top;top=top->next;free(p);return top;}}void main(){Linkstack *top,*q;int a;top=init_Linkstack();printf("please input the element of the linkstack:a=\n");scanf("%d",&a);while(a!=-1){top=Push_Linkstack(top,a);scanf("%d",&a);}q=top;printf("the original linkstack is:\n");while(q!=NULL){printf("%d\n",q->data);q=q->next;}top=Pop_Linkstack(top);printf("the top of the linkstack is: %d\n",b);printf("the linkstack after pop is:\n");q=top;while(q!=NULL){printf("%d\n",q->data);q=q->next;}}6.顺序队#include<stdio.h>#include<stdlib.h>#define MaxSize 1024typedef struct c_queue{int data[MaxSize];int front,rear;int num;}c_SeQueue;c_SeQueue *init_SeQueue(){c_SeQueue *q;q=(c_SeQueue*)malloc(sizeof(c _SeQueue));q->front=q->rear=MaxSize-1;q->num=0;return q;}int in_SeQueue(c_SeQueue *q,int x){if(q->num==MaxSize){printf("The Queue is full!\n");return(-1);}else{q->rear=(q->rear+1)%MaxSize;q->data[q->rear]=x;q->num++;return 1;}}int out_SeQueue(c_SeQueue *q){if(q->num==0){printf("The Queue isempty!\n");return -1;}else{q->front=(q->front+1)%MaxSize;printf("The element to out is: %d\n",q->data[q->front]);q->num--;return(1);}}void main(){c_SeQueue *q;int s;int i,a;q=init_SeQueue();printf("Please input the number to in_SeQueue:\n");scanf("%d",&a);while(a!=-1){if(in_SeQueue(q,a))scanf("%d",&a);}printf("The original SeQueue is:\n");s=q->front+1;for(i=0;i<q->num;i++)printf("%d\t",q->data[(s++)%MaxSize]);printf("\n");if(out_SeQueue(q))printf("The SeQueue after out_Sequeue is:\n");s=q->front+1;for(i=0;i<q->num;i++)printf("%d\t",q->data[(s++)%MaxSize]);printf("\n");}7.链队#include<stdio.h>#include<stdlib.h>#define NULL 0#define QNODE struct QNodeint x;QNODE{int data;QNODE *next;};typedef struct linkqueue{QNODE *front,*rear;}LinkQueue;LinkQueue *init_LQueue(){LinkQueue *q;QNODE *p;q=(LinkQueue*)malloc(sizeof(Lin kQueue));p=(QNODE*)malloc(sizeof(QNO DE));p->next=NULL;q->front=q->rear=p;return q;}void in_LQueue(LinkQueue *q,int x){QNODE *p;p=(QNODE*)malloc(sizeof(QNO DE));p->data=x;p->next=NULL;q->rear->next=p;q->rear=p;}int IsEmpty(LinkQueue *q){if(q->front==q->rear)return 1;elsereturn 0;}int out_LQueue(LinkQueue *q){QNODE *p;if(IsEmpty(q)){printf("the queue is empty!");return(0);}else{p=q->front->next;q->front->next=p->next;x=p->data;free(p);if(q->front->next==NULL)q->rear=q->front;return 1;}}void main(){LinkQueue *q;QNODE *s;q=init_LQueue();int a;printf("Please input linklist q:\n");scanf("%d",&a);while(a!=-1){in_LQueue(q,a);scanf("%d",&a);}printf("The original linkqueue is:\n");s=q->front->next;while(s!=q->rear->next){printf("%d\t",s->data);s=s->next;}printf("\n");if(out_LQueue(q)){printf("The outed elementis :%d\n",x);printf("The linkqueue after outqueue is:\n");s=q->front->next;while(s!=q->rear->next){printf("%d\t",s->data);s=s->next;}printf("\n");}}8.二叉树#include<stdio.h>#include<stdlib.h>#define NULL 0#define maxsize 1024typedef struct BiTNode{char data;struct BiTNode *lchild,*rchild;}BiTree;/*BiTree *InsertL(BiTree *bt,int x,BiTree *parent){BiTree *p;if(parent==NULL){printf("wrong position!\n");return NULL;}if((p=(BiTNode*)malloc(sizeof(Bi TNode)))==NULL)return NULL;p->data=x;p->lchild=NULL;p->rchild=NULL;if(parent->lchild==NULL)parent->lchild=p;else{p->lchild=parent->lchild;parent->lchild=p;}return bt;}BiTree *InsertR(BiTree *bt,intx,BiTree *parent){BiTree *p;if(parent==NULL){printf("wrong position!\n");return NULL;}if((p=(BiTNode*)malloc(sizeof(Bi TNode)))==NULL)return NULL;p->data=x;p->lchild=NULL;p->rchild=NULL;if(parent->rchild==NULL)parent->rchild=p;else{p->rchild=parent->rchild;parent->rchild=p;}return bt;}BiTree *DeleteL(BiTree *bt,BiTree *parent){BiTree *p;if(parent==NULL||parent->lchild==NULL){printf("wrong position!\n");return NULL;}p=parent->lchild;parent->lchild=NULL;free(p);return bt;}BiTree *DeleteR(BiTree *bt,BiTree *parent){BiTree *p;if(parent==NULL||parent->rchild==NULL){printf("wrong position!\n");return NULL;}p=parent->rchild;parent->rchild=NULL;free(p);return bt;}*/int initiate(BiTree *bt){if((bt=(BiTree*)malloc(sizeof(BiTree)))= =NULL)return 0;bt->lchild=NULL;bt->rchild=NULL;return 1;}BiTree *CreateBiTree(BiTree *bt){char ch;scanf("%c",&ch);if(ch=='0')bt=NULL;else{bt=(BiTree*)malloc(sizeof(BiTree ));bt->data=ch;bt->lchild=CreateBiTree(bt->lchild);bt->rchild=CreateBiTree(bt->rchild);}return bt;}void PreOrder(BiTree *bt){if(bt){printf("%c\t",bt->data);PreOrder(bt->lchild);PreOrder(bt->rchild);}}void InOrder(BiTree *bt){if(bt==NULL)return;InOrder(bt->lchild);printf("%c\t",bt->data);InOrder(bt->rchild);}void PostOrder(BiTree *bt){if(bt==NULL)return;PostOrder(bt->lchild);PostOrder(bt->rchild);printf("%c\t",bt->data);}void main(){BiTree *p;if(initiate(p)==1)p=CreateBiTree(p);printf("先序遍历：\n");PreOrder(p);printf("\n中序遍历：\n");InOrder(p);printf("\n后序遍历：\n");PostOrder(p);}9.图9.1图的邻接矩阵#include<stdio.h>#include<stdlib.h>#define maxsize 1000typedef struct graph{int v[maxsize];int arcs[maxsize][maxsize];int n,e;}graph;void CreateAdj(graph *g){int i,j,k;printf("Please input 顶点数和边数（格式n,e）：\n");scanf("%d,%d",&(g->n),&(g->e));printf("Please input 顶点名称：\n");for(k=0;k<=g->n-1;k++)scanf("%d",&(g->v[k]));for(i=0;i<g->n;i++)for(j=0;j<g->n;j++)g->arcs[i][j]=0;for(k=1;k<=g->e;k++){printf("请输入第 %d 条边的左顶点号和右顶点号（格式i,j）：\n",k);scanf("%d,%d",&i,&j);g->arcs[i][j]=1;g->arcs[j][i]=1;}}void main(){int i,j;graph *g;g=(graph*)malloc(sizeof(graph));CreateAdj(g);printf("图的邻接矩阵为：\n");for(i=0;i<g->n;i++){for(j=0;j<g->n;j++)printf("%d ",g->arcs[i][j]);printf("\n");}}9.2图的邻接表#include<stdio.h>#include<stdlib.h>#define maxsize 100typedef struct link{int adjvex;struct link *next;}EdgeNode;typedef struct headnode{int v;EdgeNode *next;}VertexNode;typedef VertexNodeAdjList[maxsize];typedef struct{AdjList adjlist;int n,e;}ALGraph;void CreateALGraph(ALGraph *G){int i,j,k;EdgeNode *s;printf("请输入顶点数和边数：\n");scanf("%d,%d",&(G->n),&(G->e));printf("请输入顶点信息：\n");for(i=1;i<=G->n;i++) //建立头结点{scanf("%d",&(G->adjlist[i].v));G->adjlist[i].next=NULL;}printf("请输入边的信息（格式为:i,j）：\n");for(k=0;k<G->e;k++){scanf("%d,%d",&i,&j);s=(EdgeNode*)malloc(sizeof(Ed geNode));s->adjvex=j;s->next=G->adjlist[i].next; //头插法建表G->adjlist[i].next=s;}}void main(){ALGraph *G;EdgeNode *p;int a;G=(ALGraph*)malloc(sizeof(ALG raph));CreateALGraph(G);for(a=1;a<=G->n;a++){printf("%d\t",G->adjlist[a].v);p=G->adjlist[a].next;while(p!=NULL){printf("%d ",p->adjvex);p=p->next;}printf("\n");}}10.查找10.1顺序查找#include<stdio.h>#include<stdlib.h>typedef struct{int key;char name[9];char sex[2];int result;}student;typedef struct{student elem[1000];int length;}S_TBL;S_TBL *insert(S_TBL *tbl,student *s) {tbl->elem[tbl->length]=*s;tbl->length++;return tbl;}int seq_search(S_TBL *tbl,int kx){int i;tbl->elem[0].key=kx;for(i=tbl->length;tbl->elem[i].key!=kx;i--);return i;}void main(){S_TBL *tbl;tbl=(S_TBL*)malloc(sizeof(S_TB L));tbl->length=1;int a,b,i;student *s;printf("Please input the number of students:\n");scanf("%d",&a);printf("Please input information of a student (key,name,sex,result):\n"); for(i=1;i<=a;i++){s=(student*)malloc(sizeof(stude nt));scanf("%d%s%s%d",&s->key,s->name,s->sex,&s->result);insert(tbl,s);}printf("Please input the key of thr student to search:\n");scanf("%d",&b);if(seq_search(tbl,b))printf("success!:\n");elseprintf("fail!:\n");}10.2二分查找#include<stdio.h>#include<stdlib.h>typedef struct{int key;char name[9];char sex[2];int result;}student;typedef struct{student elem[1000];int length;}S_TBL;S_TBL *insert(S_TBL *tbl,student *s) {tbl->length++;tbl->elem[tbl->length]=*s;return tbl;}int binary_search(S_TBL *tbl,int kx) {int low,high,mid,flag=0;low=1;high=tbl->length;while(low<=high){mid=(low+high)/2;if(kx<tbl->elem[mid].key)high=mid-1;else if(kx>tbl->elem[mid].key)low=mid+1;else{flag=mid;break;}}return flag;}void main(){S_TBL *tbl;tbl=(S_TBL*)malloc(sizeof(S_TB L));tbl->length=0;int a,b,i;student *s;printf("Please input the number of students:\n");scanf("%d",&a);printf("Please input information of a student (key,name,sex,result):\n"); for(i=1;i<=a;i++){s=(student*)malloc(sizeof(stude nt));scanf("%d%s%s%d",&s->key,s->name,s->sex,&s->result);insert(tbl,s);} printf("Please input the key of thr student to search:\n");scanf("%d",&b);if(binary_search(tbl,b))printf("the position of the student is:%d\n",binary_search(tbl,b));elseprintf("fail!:\n");}11.排序11.1插入排序#include<stdio.h>#include<stdlib.h>typedef struct{int key;char name[9];char sex[2];int result;}student;typedef struct{student elem[1000];int length;}S_TBL;S_TBL *insert(S_TBL *tbl,student *s) {tbl->length++;tbl->elem[tbl->length]=*s;return tbl;}void insertsort(S_TBL *tbl){int i,j;for(i=2;i<=tbl->length;i++){tbl->elem[0]=tbl->elem[i];j=i-1;while(tbl->elem[0].key<tbl->elem[j].key){tbl->elem[j+1]=tbl->elem[j];j--;}tbl->elem[j+1]=tbl->elem[0];}}void main(){S_TBL *tbl;tbl=(S_TBL*)malloc(sizeof(S_TB L));tbl->length=0;int a,b,i;student *s;printf("Please input the number of students:\n");scanf("%d",&a);printf("Please input information of a student (key,name,sex,result):\n"); for(i=1;i<=a;i++){s=(student*)malloc(sizeof(stude nt));scanf("%d%s%s%d",&s->key,s->name,s->sex,&s->result);insert(tbl,s);}insertsort(tbl);for(i=1;i<=tbl->length;i++){printf("%d\t%s\t%s\t%d\n",tbl->elem[i].key,tbl->elem[i].name,tbl->elem[i].sex,tbl->elem[i].result);}}11.2选择排序#include<stdio.h>#include<stdlib.h>typedef struct{int key;char name[9];char sex[2];int result;}student;typedef struct{student elem[1000];int length;}S_TBL;S_TBL *insert(S_TBL *tbl,student *s) {tbl->length++;tbl->elem[tbl->length]=*s;return tbl;}void selectsort(S_TBL *tbl){int i,j,k;for(i=1;i<tbl->length;i++){k=i;for(j=i+1;j<=tbl->length;j++)if(tbl->elem[j].key<tbl->elem[k].key)k=j;if(k!=i){tbl->elem[0]=tbl->elem[k];tbl->elem[k]=tbl->elem[i];tbl->elem[i]=tbl->elem[0];}}}void main(){S_TBL *tbl;tbl=(S_TBL*)malloc(sizeof(S_TB L));tbl->length=0;int a,b,i;student *s;printf("Please input the number of students:\n");scanf("%d",&a);printf("Please input information of a student (key,name,sex,result):\n"); for(i=1;i<=a;i++){s=(student*)malloc(sizeof(stude nt));scanf("%d%s%s%d",&s->key,s->name,s->sex,&s->result);insert(tbl,s);}selectsort(tbl);for(i=1;i<=tbl->length;i++)printf("%d\t%s\t%s\t%d\t\n",tbl->elem[i].key,tbl->elem[i].name,tbl->elem[i].sex,tbl->elem[i].result);}11.3冒泡排序#include<stdio.h>#include<stdlib.h>typedef struct{int key;char name[9];char sex[2];int result;}student;typedef struct{student elem[1000];int length;}S_TBL;/*S_TBL *insert(S_TBL *tbl,student *s) {tbl->length++;tbl->elem[tbl->length]=*s;return tbl;}*/void bubblesort(S_TBL *tbl){int i,j,flag;for(i=1;i<tbl->length;i++){flag=1;for(j=1;j<=tbl->length-i;j++)if(tbl->elem[j+1].key<tbl->elem[j].key){flag=0;tbl->elem[0]=tbl->elem[j];tbl->elem[j]=tbl->elem[j+1];tbl->elem[j+1]=tbl->elem[0];}if(flag==1)return;}}void main(){S_TBL *tbl;tbl=(S_TBL*)malloc(sizeof(S_TB L));tbl->length=0;int a,b,i;printf("Please input the number of students:\n");scanf("%d",&a);printf("Please input information of a student (key,name,sex,result):\n"); for(i=1;i<=a;i++){scanf("%d%s%s%d",&tbl->elem[i].key,tbl->elem[i].name,tbl->elem[i].sex,&tbl->elem[i].result);tbl->length++;}bubblesort(tbl);for(i=1;i<=tbl->length;i++)printf("%d\t%s\t%s\t%d\t\n",tbl->elem[i].key,tbl->elem[i].name,tbl->elem[i].sex,tbl->elem[i].result);}12.通讯录的制作#include "stdio.h"#include "stdlib.h"#include "ctype.h"#include "string.h"typedef struct cont{char NAME[20];char SCHOOL[20];char CITY[20];char EIP[20];char STATE[20];struct cont *next;}Contact;int menu_select(){char c;do{system("cls");printf("\n\n\n\n\n");printf("*************************** **^^****^^****^^****^^******** **********************");printf("*************************** ***通讯录管理系统****************************");printf("*************************** *****&&&&&&&&&&&&&&&&&&&&&** ****************************");printf("\n\n\n\n\n\n\n\n\n\n") ;printf(" \t 1.输入信息\n");printf(" \t 2.显示信息\n");printf(" \t 3.查找信息\n");printf(" \t 4.删除信息\n");printf(" \t 5.插入信息\n");printf(" \t 6.信息装入\n");printf(" \t 7.信息存盘\n");printf(" \t 0.程序停止\n");printf(" \t 请输入：0~7:");c=getchar();}while(c<'0'||c>'7');return(c-'0');}Contact *insert(Contact*head,Contact *s){Contact *p1,*p2;if(head==NULL){head=s;s->next=NULL;return head;}p2=p1=head;while(p1->next!=NULL&&strcmp(s->NAME,p1->NAME)>0){p2=p1;p1=p1->next;}if(strcmp(s->NAME,p1->NAME)<=0){s->next=p1;if(head==p1)head=s;elsep2->next=s;}else{p1->next=s;s->next=NULL;}return (head);}Contact *Create(Contact *head){Contact *s;char c='y';printf("create an increasing list.....\n");printf("请输入个人信息（格式为：姓名学校城市邮编国籍）：\n");while(c=='y'){s=(Contact*)malloc(sizeof(Contact));scanf("%s%s%s%s%s",s->NAME,s->SCHOOL,s->CITY,s->EIP,s->STATE);head=insert(head,s);printf("contine or not? (y/n) ");getchar();c=getchar();if(c=='n'){printf("create over.....\n");break;}elseprintf("请输入个人信息（格式为：姓名学校城市邮编国籍）：\n");}return head;}void Display(Contact *head){Contact *s;s=head;printf("\t输入的数据为:\n");while(s!=NULL){printf("%s\t%s\t%s\t%s\t%s\n",s->NAME,s->SCHOOL,s->CITY,s->EIP,s->STATE);s=s->next;}}Contact *Insert_a_record(Contact*head){Contact *s;char c='y';while(c=='y'){s=(Contact*)malloc(sizeof(Contact));printf("请输入个人信息（格式为：姓名学校城市邮编国籍）：\n");scanf("%s%s%s%s%s",s->NAME,s->SCHOOL,s->CITY,s->EIP,s->STATE);head=insert(head,s);printf("sucess!\nDo you want to continue? (y/n) ");getchar();c=getchar();if(c=='n')printf("插入完成!");}return head;}Contact *Query(Contact *head,char *NAME){Contact *p;p=head;while(p!=NULL){if(strcmp(p->NAME,NAME)==0)return p;p=p->next;}return NULL;}void Query_a_record(Contact *head){char NAME[20];Contact *s;printf("input name the name to query: ");scanf("%s",NAME);s=Query(head,NAME);if(s!=NULL){printf(" sucess!\n");printf("The contact you are looking for is : \n");printf("%s\t%s\t%s\t%s\t%s\n",s->NAME,s->SCHOOL,s->CITY,s->EIP,s->STATE);}elseprintf("The contact can't be found!");}Contact *Delete(Contact *head,char *NAME){Contact *p1,*p2;if(head==NULL){printf("The list is empty!");return NULL;}p1=head;while(strcmp(p1->NAME,NAME)!=0&&p1->next!=NULL) {p2=p1;p1=p1->next;}if(strcmp(p1->NAME,NAME)==0){if(p1==head)head=p1->next;elsep2->next=p1->next;printf("The contact was deleted!\n");free(p1);}elseprintf("The contact is not found!\n");return head;}Contact *Delete_a_record(Contact *head){Contact *p;char str[20];char c;printf("Please input the name of the contact to delete: ");scanf("%s",str);p=Query(head,str);if(p==NULL)printf("The contact is not found!\n");else{printf("Are you sure to delete？(y/n): ");。