建立單鏈表c語言程序2.doc

實(shí)現(xiàn)功能：1. 創(chuàng)建一個(gè)新鏈表。2. 插入節(jié)點(diǎn)。3. 刪除節(jié)點(diǎn)。4. 插入法排序鏈表（從小到大）。5. 選擇法排序鏈表（從小到大）。6. 顯示當(dāng)前鏈表。0. 退出程序。./*單向鏈表的相關(guān)操作*/* 2010.03.27 */.#include stdio.h#include malloc.h#include stdlib.h#define null 0int length;struct Listint data;struct List *next;List;struct List * InitList()struct List *head,*p,*q;int d;printf(n創(chuàng)建一個(gè)鏈表：nn);head=(struct List *)malloc(sizeof(struct List);head-next=null; q=head;scanf(%d,&d);while(d0) p=(struct List *)malloc(sizeof(struct List); p-next=null; p-data=d; q-next=p; q=p; scanf(%d,&d); length+;return head;void ListInsert(struct List *head,int i,int e)struct List *p,*q;int j=1;if(i0&i0) p=head; while(jnext; j+; q=(struct List *)malloc(sizeof(struct List); q-data=e; q-next=p-next; p-next=q; length+=1;else printf(n對(duì)不起您所輸入的節(jié)點(diǎn)位置或數(shù)據(jù)出錯(cuò)，數(shù)據(jù)插入失敗！n);int ListDelete(struct List *head,int i,int e)struct List *p,*q;int j=0;if(i0&i=length) p=head; while(jnext; j+; e=p-next-data; q=p-next; p-next=q-next; free(q); length-=1; return e;else printf(n對(duì)不起您所輸入的節(jié)點(diǎn)位置出錯(cuò)，數(shù)據(jù)刪除失敗！n); return null; void ListInsertSort (struct List *head)struct List *p,*q,*s;q=head-next-next;head-next-next=null;while(q) s=q-next; p=head; while(p-next&p-next-datadata) p=p-next; q-next=p-next; p-next=q; q=s;void ListChooseSort (struct List *head)struct List *p,*q;int t;for(p=head-next;p-next;p=p-next) for(q=p-next;q;q=q-next) if(p-dataq-data) t=p-data; p-data=q-data; q-data=t; void print(struct List *head)struct List *p;if(head) p=head-next; while(p) printf(%5d ,p-data); p=p-next; printf(n);void main()struct List *head;int i,e,n;head=null;do system(cls); printf(nn 單向鏈表的相關(guān)操作nnn); printf( 1. 創(chuàng)建一個(gè)新鏈表。nn); printf( 2. 插入節(jié)點(diǎn)。nn); printf( 3. 刪除節(jié)點(diǎn)。nn); printf( 4. 插入法排序鏈表（從小到大）。nn); printf( 5. 選擇法排序鏈表（從小到大）。nn); printf( 6. 顯示當(dāng)前鏈表。nn); printf( 0. 退出程序。nnnn); printf( 請(qǐng)選擇所要操作的項(xiàng)目：); scanf(%d,&n); switch(n) case 1: system(cls); head=InitList(); printf(n您所創(chuàng)建的鏈表為：); print(head); printf(n); system(pause); break; case 2: system(cls); if(length) printf(n當(dāng)前鏈表為：); print(head); printf(n請(qǐng)輸入要插入的節(jié)點(diǎn)位置及要插入的數(shù)據(jù):); scanf(%d%d,&i,&e); ListInsert(head,i,e); printf(n插入節(jié)點(diǎn)后的鏈表為：); print(head); else printf(n請(qǐng)先創(chuàng)建鏈表，再執(zhí)行此操作！nn); printf(n); system(pause); break; case 3: system(cls); if(length) printf(n當(dāng)前鏈表為：); print(head); printf(n請(qǐng)輸入要?jiǎng)h除的節(jié)點(diǎn)位置:); scanf(%d,&i); e=ListDelete(head,i,e); printf(n您所刪除的節(jié)點(diǎn)處的數(shù)據(jù)為%dnn,e); if(length) printf(刪除節(jié)點(diǎn)后的鏈表為：); else printf(刪除節(jié)點(diǎn)后的鏈表為空表。); print(head); else printf(n請(qǐng)先創(chuàng)建鏈表，再執(zhí)行此操作！nn); printf(n); system(pause); break; case 4: system(cls); if(length) printf(n當(dāng)前鏈表為：); print(head); ListInsertSort(head); printf(n排序后的鏈表為：); print(head); else printf(n請(qǐng)先創(chuàng)建鏈表，再執(zhí)行此操作！nn); printf(n); system(pause); break; case 5: system(cls); if(length) printf(n當(dāng)前鏈表為：); print(head); ListChooseSort(head); printf(n排序后的鏈表為：); print(head); else printf(n請(qǐng)先創(chuàng)建鏈表，再執(zhí)行此操作！nn); printf(n); system(pause); break; case 6: system(cls); if(length) printf(n當(dāng)前鏈表為：); print(head); else printf(n請(qǐng)先創(chuàng)