《数据结构》实验报告.doc

文档介绍：NurfürdenpersönlichenfürStudien,Forschung,zukommerziellenZweckenverwendetwerden姓名:关宏新学号:0班级:计084班指导教师:储岳中实验一线性表基本操作的实现一、实验目的1、;2、掌握线性表的基本操作:插入、删除、查找等运算在顺序存储结构和链式存储结构上的运算。二、实验要求1、链表插入、删除和查找算法的代码;2、程序运行结果及分析;3、实验总结。三、实验内容1、认真阅读和掌握本实验的参考程序。2、上机运行本程序,并完善删除、查找等运算。3、保存程序的运行结果,并结合程序进行分析。4、按照你对链表操作需要,重新改写算法并运行,实现链表的插入、删除、查找等运算,并保存运行结果。四、程序流程图、算法及运行结果1-1#include""#include""#defineMAXSIZE100structSeqList{intdata[MAXSIZE];intlength;};typedefstructSeqList*PSeqList;PSeqListcreaeNullList_seq(){PSeqListpalist=(PSeqList)malloc(sizeof(structSeqList));if(palist!=NULL){palist->length=0;return(palist);}printf("Outofspace!!\n");returnNULL;}intisNullList_seq(PSeqListpalist){return(palist->length==0);}intinsertPre_seq(PSeqListpalist,intp,intx){intq;if(palist->length>=MAXSIZE){printf("overflow!\n");return(0);}if(p<0||p>palist->length){printf("Notexist!\n");return(0);}if(isNullList_seq(palist)){palist->data[0]=x;palist->length=1;return(1);}for(q=palist->length-1;q>=p;q--)palist->data[q+1]=palist->data[q];palist->data[p]=x;palist->length=palist->length+1;return(1);}voidmain(){inti;PSeqListlist;list=creaeNullList_seq();printf("插入前的顺序表为:\n");for(i=0;i<=9;i++){insertPre_seq(list,i,i*i);printf("%d",list->data[i]);}insertPre_seq(list,5,55);printf("\n插入后的顺序表为:\n");for(i=0;i<list->length;i++)printf("%d",list->data[i]);printf("\n");getch();}1-2#include""#include""#defineMAXSIZE100structSeqList{intdata[MAXSIZE];intlength;};typedefstructSeqList*PSeqList;PSeqListcreaeNullList_seq(){PSeqListpalist=(PSeqList)malloc(sizeof(structSeqList));if(palist!=NULL){palist->length=0;return(palist);}printf("Outofspace!!\n");returnNULL;}intisNullList_seq(PSeqListpalist){return(palist->length==0);}/*插入*/intinsertPre_seq(PSeqListpalist,intp,intx){intq;if(palist->length>=MAXSIZE){printf("overflow!\n");return(0);}if(p<0||p>palist->length){printf("Notexist!\n");return(0);}if(isNullList_seq(palist)){palist->data[0]=x;palist->length=1;return(1);}for(q=palist->length-1;q>