數(shù)據(jù)結(jié)構(gòu)實驗五查找的實現(xiàn)

1、實驗五查找的實現(xiàn)一、實驗內(nèi)容1、建立一個線性表，對表中數(shù)據(jù)元索存放的先后次序沒冇任何要求。輸入 待杳數(shù)據(jù)元素的關(guān)鍵字進行杳找。為了簡化算法，數(shù)據(jù)元素只含一個整型關(guān)鍵字 字段，數(shù)據(jù)元素的其余數(shù)據(jù)部分忽略不考慮。建議采用前哨的作用，以捉高查找 效率。2、查找表的存儲結(jié)構(gòu)為有序表，輸入待查數(shù)據(jù)元素的關(guān)鍵字利用折半查找 方法進行查找。此程序中要求對整型量關(guān)鍵字數(shù)據(jù)的輸入按從小到大排序輸入。二、源代碼和執(zhí)行結(jié)果1、#include<iostream> using namespace std ;#dcfinc max 100#define keytype inttypedef structkc

2、ytypc key ;datatype;typedef structdatatypc clcmmax;int length ;jseqtable, *pseqtable ;pseqtable init_seqtable()pseqtable p = (pseqtable)malloc(sizeof(seqtable);if(p != null)p->length = 0 ;return p ;)elsecout«nout of space! n«endl ; return null;int insert_seqtable(pseqtable p ,keytype x)

3、if(p->length >= max)cout«novcrflow!h«cndl ; return 0 ;p->elemp->lengthkey = x ;p->length + ; return 1 ;int seqsearch(seqtable s ,keytype k)int n , i = 0 ;n = sength ;s.elemn.key = k;while(s.elemi.key != k)i+ ；if(i = n)return -1 ;elsereturn i;void main()pseqtable p ;int i, n

4、;keytype a;p = init_scqtablc();cout«n請輸入數(shù)據(jù)個數(shù)：”； cin»n ;cout«hiw輸入數(shù)據(jù)：”«endl;for(i = 0 ; i < n ; i +)cin»a ; insert_seqtable(p, a);cout«"請輸入要查找的數(shù)據(jù)，輸入32767結(jié)束：”; cin»a ;while(a != 32767)1 =scqscarch(*p , a);if(i = -1)cout«"無此數(shù)據(jù)！請重新輸入：”vvcndl ; cin

5、7;a ;elsecout«n該數(shù)據(jù)的位置是：n«i+l«endl;:10cout«"請輸入要查找的數(shù)據(jù)：“； cin»a ;淪入數(shù)27 68 95 33 18 9 45 89 24輸爰查拔輸人3276?結(jié)束：5此數(shù)龜請1832767居 居 數(shù)數(shù) 位查位查縫 的音3 聶m冃聶m冃青2.# include<iostream> using namespace std ;#define max 100#define keytype inttypedef structkeytype key ;datatype;typedef st

6、ructdatatype elemmaxj ;int length ;(bintable, *pbintable;pbintable init_bintable()pbintable p = (pbintablc)malloc(sizcof(bintablc); if(p != null)p->length = 0 ; return p ;elsecout«nout of space! n«endl ;return null;int insert_bintable(pbintable p ,keytype x) if(p->length >= max)co

7、ul«hoverflow!m«endl; return 0 ; p->elemfp->length.key = x ; p->lcngth + ;return 1 ;int binsearch(bintable s ,keytype k)int low、mid , high ;low = 0;high = s length 1 ; while(low <= high)mid = (low+high)/2 ; if(s.elemmidj.key = k) return mid ;else if(s.elemmid.key > k) high =

8、mid - 1 ;elselow = mid +1 ;return ;void main()pbintable p ;int i, n ;keytype a ;p = init_bintable();cout«*請輸入數(shù)據(jù)個數(shù)：”；cin»n ;cout«-w按從小到大的順序輸入數(shù)據(jù):n«endl;for(i = 0 ; i < n ; i +)cin»a ; inscrt_bintablc(p, a);)cout«n請輸入耍查找的數(shù)據(jù)，輸入32767結(jié)束：”; cin»a ;while(a != 32767)i =binsearch(*p , a);if(i = -1)co