算法與數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)2

1、實(shí)驗(yàn)題目實(shí)驗(yàn)1姓名學(xué)號(hào)專業(yè)實(shí)驗(yàn)時(shí)間實(shí)驗(yàn)地點(diǎn)實(shí)驗(yàn)成績(jī)實(shí)驗(yàn)性質(zhì)乎證性 口設(shè)計(jì)性 口綜合性教師評(píng)價(jià)：口實(shí)驗(yàn)過程正確；口實(shí)驗(yàn)內(nèi)容提交口實(shí)驗(yàn)步驟合理；口實(shí)驗(yàn)結(jié)果正確；口操作正確；口報(bào)告規(guī)范；其他：評(píng)價(jià)教師簽名：一、實(shí)驗(yàn)項(xiàng)目?jī)?nèi)容補(bǔ)充代碼1、 代碼：#include <stdio.h>#include <string.h>#include <stdlib.h>#define MAXSIZE 255typedef structint id;char name50;ElementType;typedef structElementType *datas;int length;

2、SeqList;ElementType dataArray=1,"mingren",2,"xiaoying",3,"zuoluo",4,"woailuo"初始化void InitList(SeqList &seqlist) seqlist.datas=(ElementType *)malloc(sizeof(ElementType) *MAXSIZE); if(!seqlist.datas) return; seqlist.length=0;插入void InsertElement(SeqList &

3、;seqlist,int pos,ElementType element) if(pos < 1 | pos > seqlist.length + 1)printf("下標(biāo)不合法，插入失敗");return;if(seqlist.length = MAXSIZE)printf("數(shù)組已滿");return;for(int i=seqlist.length -1;i>=pos -1;i+)seqlist.datasi+1=seqlist.datasi;seqlist.dataspos- 1=element;seqlist.length+;

4、刪除void DeleteElement(SeqList &seqlist,int pos)if(pos < 1| pos > seqlist.length)printf("刪除下標(biāo)不合法，刪除失敗")；return;for(int i=pos;i<=seqlist.length -1;i+)seqlist.datasi -1=seqlist.datasi;seqlist.length -;查找void LocateElement(SeqList &seqlist,ElementType element) for(int i=0;i<

5、seqlist.length;i+)if(!strcmp(,)printf("查找成功，元素序號(hào)為%d",i+1);return;printf("查找失敗!");顯示void PrintList(SeqList &seqList)for(int i=0;i<seqList.length;i+)printf("%dt%sn",seqList.datasi.id,seqL); void TestSwquenceList()SeqList seqList;InitList(seqList);for(int i = 0;i < 4;i+)InsertElement(seqList,i + 1,dataArrayi);PrintList(seqList);DeleteElement(seqList,2);printf("n 刪除后 n");PrintList(seqList);ElementType element = 1,"woailuo&