分块查找代码简单例子

//分块查找，利用主表A和大小为M的索引表B分块查找关键字为key的记录。int BlockSearch(mainlist A,indexlist B,int m,KeyType key){int i,j;for(i=0;i<m;i++){    if(key<=B[i].index)break;}if(i==m)return -1;    j = B[i].start;while(j<B[i].start+B[i].length){if(key ==A[j].key)break;elsej++;}if(j<B[i].start+B[i].length){return j;}elsereturn -1;}