1、iostreamusing namespace std ;#define MAX 100#define KeyType inttypedef struct KeyType key ;DataType ; DataType elemMAX ; int length ;SeqTable , *PSeqTable ;PSeqTable Init_SeqTable() PSeqTable p = (PSeqTable)malloc(sizeof(SeqTable) ; if(p != NULL) p-length = 0 ; return p ; else coutlength = MAX)overf
2、low! return 0 ; p-elemp-length.key = x ;length + ; return 1 ;int SeqSearch(SeqTable s ,KeyType k) int n , i = 0 ; n = s.length ; s.elemn.key = k ; while(s.elemi.key != k) i + ; if(i = n) return -1 ; else return i ;void main() PSeqTable p ; int i , n ; KeyType a ; p = Init_SeqTable() ; coutn ;请输入数据:
3、for(i = 0 ; i a ; insert_SeqTable(p , a) ;请输入要查找的数据,输入32767结束: while(a != 32767) i =SeqSearch(*p , a) ; if(i = -1) cout else该数据的位置是:i+1请输入要查找的数据:2、BinTable , *PBinTable ;PBinTable Init_BinTable() PBinTable p = (PBinTable)malloc(sizeof(BinTable) ;int insert_BinTable(PBinTable p ,KeyType x)int BinSearch(BinTable s ,KeyType k) int low , mid , high ; low = 0 ; high = s.length-1 ; while(low k) high = mid - 1 ; low = mid +1 ; return -1 ; PBinTable p ; p = Init_BinTable() ;请按从小到大的顺序输入数据: insert_BinTable(p , a) ; i =BinSearch(*p , a) ; if(i = -1)Welcome ToDownload !欢迎您的下载,资料仅供参考!