實(shí)驗(yàn)報(bào)告四-數(shù)據(jù)結(jié)構(gòu)

寧波大學(xué)科學(xué)技術(shù)學(xué)院數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)報(bào)告實(shí)驗(yàn)名稱數(shù)據(jù)查找實(shí)驗(yàn)者08信計(jì)肖勤偉一實(shí)驗(yàn)名稱順序表的查找算法比較分析二實(shí)驗(yàn)?zāi)康氖煜れo態(tài)查找的相關(guān)算法三實(shí)驗(yàn)內(nèi)容實(shí)現(xiàn)順序表的查找算法實(shí)現(xiàn)有序表的折半查找算法四實(shí)驗(yàn)步驟：1需求分析需要建立一個(gè)線性表2算法概要建立一個(gè)表，輸入查找的數(shù)據(jù)，顯示數(shù)據(jù)是否在表里3抽象數(shù)據(jù)操作intseqsearch(elementlist[],intsearchnum,intnum)順序查找intbinsearch(elementlist[],intsearchnum,intnum)折半查找4詳細(xì)設(shè)計(jì)（源代碼）#include<stdio.h>#defineMAX_SIZE100typedefstruct{intkey;}element;elementlist[MAX_SIZE];intseqsearch(elementlist[],intsearchnum,intnum);intmain(){inti,num,searchnum,k;printf("請(qǐng)輸入元素的個(gè)數(shù)：");scanf("%d",&num);printf("請(qǐng)輸入元素：\n");for(i=0;i<num;i++){scanf("%d",&list[i].key);}while(1){printf("請(qǐng)輸入要查詢的數(shù)據(jù)元素:");scanf("%d",&searchnum);k=seqsearch(list,searchnum,num);if(k!=-1){printf("所查詢?cè)氐南聵?biāo)為：");printf("%d\n",k);}elseprintf("查詢?cè)夭淮嬖?。\n");}return0;}intseqsearch(elementlist[],intsearchnum,intnum){intj;list[num].key=searchnum;for(j=0;list[j].key!=searchnum;j++);returnj<num?j:-1;}折半查找：#include<stdio.h>#defineMAX_SIZE100#defineCOMPARE(a,b)(a)>(b)?1:(a)==(b)?0:-1typedefstruct{intkey;}element;elementlist[MAX_SIZE];intbinsearch(elementlist[],intsearchnum,intnum);intmain(){inti,num,searchnum,k;printf("請(qǐng)輸入元素的個(gè)數(shù)：");scanf("%d",&num);printf("請(qǐng)輸入元素：\n");for(i=0;i<num;i++){scanf("%d",&list[i].key);}while(1){printf("請(qǐng)輸入要查詢的數(shù)據(jù)元素:");scanf("%d",&searchnum);k=binsearch(list,searchnum,num);if(k!=-1){printf("所查詢?cè)氐南聵?biāo)為：");printf("%d\n",k);}elseprintf("查詢?cè)夭淮嬖?。\n");}return0;}intbinsearch(elementlist[],intsearchnum,intnum){intleft=0,right=num-1,middle;while(left<=right){middle=(left+right)/2;switch(COMPARE(list[middle].key,searchnum)){case1:right=middle-1;break;case0:returnmiddle;case-1:left=middle+1;}}return-1;}五實(shí)驗(yàn)結(jié)果測(cè)試數(shù)據(jù)12