算法与数据结构的顺序查找.docVIP

#include stdio.h #includestdlib.h #includestring.h #define MAX 31 typedef struct { int *k; int *elem; char *aa; int length; }SSTable; int lw_Search(SSTable ST,int key) { int i; ST.elem[0]=key; for(i=ST.length;ST.elem[i]!=ST.elem[0];--i); return i; } int lw_Search2(SSTable ST,int n,int key) { int low=1;int high=ST.length;int mid,a=0; while(low=high) { mid=(low+high)/2; printf(第%d次查找:在[%d,%d]中找到元素ST[%d]: %d\n,++a,low,high,mid,ST.k[mid]); if(ST.k[mid]==key) return mid; else if(ST.k[mid]key) high=mid-1; else low=mid+1; } return 0; } int lw_bubble(SSTable ST,int n