分块查找

#include <stdio.h>  
#define MAX1 100    //数据表的最大长度  
#define MAX2 20     //索引表的最大长度  

typedef int ElemType;  
typedef char InfoType[10];  
typedef struct  
{  
    ElemType key;                //KeyType为关键字的数据类型  
    InfoType data;              //其他数据  
} NodeType;
  
typedef NodeType SeqList[MAX1]; //顺序表类型  
  
typedef struct  
{  
    ElemType key;            //KeyType为关键字的类型  
    int link;               //指向对应块的起始下标  
} IdxType;  

typedef IdxType IDX[MAX2];  //索引表类型  
  
int IdxSearch(IDX I,int m,SeqList R,int n,ElemType k)  
{  
    int low=0,high=m-1,mid,i;  
    int b=n/m;              //b为每块的记录个数  
    while (low<=high)       //在索引表中进行二分查找,找到的位置存放在low中  
    {  
        mid=(low+high)/2;  
        if (I[mid].key>=k)  
            high=mid-1;  
        else  
            low=mid+1;  
    }  
    //应在索引表的high+1块中,再在线性表中进行顺序查找  
    i=I[high+1].link;  
    while (i<=I[high+1].link+b-1 && R[i].key!=k) i++;  
    if (i<=I[high+1].link+b-1)  
        return i+1;  
    else  
        return 0;  
}  
  
int main()  
{  
    int i,n=20,m=4,j;  
    SeqList R;  
    IDX I= {{25,0},{46,5},{60,10},{92,15}};  
    ElemType a[]= {8,13,25,19,22,29,46,38,30,35,50,60,49,57,55,65,70,89,92,70};  
    ElemType x=49;  
    for (i=0; i<n; i++)  
        R[i].key=a[i];  
    j=IdxSearch(I,m,R,n,x);  
    if (j!=0)  
        printf("%d是第%d个数据\n",x,j);  
    else  
        printf("查找失败%d\n",x);  
    return 0;  
}