数据结构 上级程序一(C语言).doc

《数据结构 上级程序一(C语言).doc》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、程序一：顺序表的运算#defineMAX100#include"stdio.h"intn;intinsert(intb[],intx,inti){intj;if(n>=MAX)return(0);if(i<1

2、

3、i>n+1)return(0);else{for(j=n;j>=i;j--)b[j]=b[j-1];b[j]=x;n++;return(1);}}intdelete(intb[],inti){intj;if(n==0)return(0);if(i<1

4、

5、i>n)return(0);else{for(j=

6、i;j

7、elete");printf("3.exit");printf("************************");printf("Pleaseselect(1-3):");scanf("%d",&sel);switch(sel){case1:printf("Pleaseinputtheinsertednumber:");scanf("%d",&x);printf("Pleaseinputtheinsert-location:");scanf("%d",&i);result=insert(a,x

8、,i);if(result==1){printf("Theresultafterinsert:");print(a);}break;case2:printf("Pleaseinputtheindexofdelete:");scanf("%d",&i);result=delete(a,i);if(result==1){printf("Theresultafterdelete:");print(a);}break;case3:quit();break;default:printf("INPUTS

9、ELECTERROR!PlEASERETRY!");}}}程序二：单链表的运算#include"stdio.h"#include"stdlib.h"structlink{intdata;structlink*next;};typedefstructlinkNODE;NODE*rcreat(){NODE*p,*r,*s;inti;s=(NODE*)malloc(sizeof(NODE));p=s;r=s;s->next=NULL;printf("Pleaseinputdata:");scanf("

10、%d",&i);while(i){s=(NODE*)malloc(sizeof(NODE));s->data=i;r->next=s;r=s;printf("Pleaseinputdata:");scanf("%d",&i);}r->next=NULL;return(p);}voidprint(NODE*head){NODE*p;p=head->next;while(p){printf("%5d",p->data);p=p->next;}}voidinsert(NODE*head,intx,inti){NO

11、DE*p,*s;intcount=0;p=head;while(countnext;count++;}s=(NODE*)malloc(sizeof(NODE));s->data=x;s->next=p->next;p->next=s;}intdelete(NODE*head,inti){NODE*p=head,*q;intcount=0;intdel_data;if(head->next==NULL)return(0);else{while(countnext;cou

12、nt++;}q=p->next;p=q->next;del_data=q->data;free(q);return(del_data);}}main(){NODE*head;intc,x,i,d;head=rcreat();printf("Scaningresult:");print(head);while(1){printf("**********************