C语言数据结构插值查找

#include<stdio.h>

#define MAX 10

// array of items on which linear search will be conducted. 
int List[MAX] = { 10, 14, 19, 26, 27, 31, 33, 35, 42, 44 };

int find(int data) {
   int lo = 0;
   int hi = MAX - 1;
   int mID = -1;
   int comparisons = 1;      
   int index = -1;

   while(lo <= hi) {
      printf("
Comparison %d  \n" , comparisons ) ;
      printf("lo : %d, List[%d] = %d\n", lo, lo, List[lo]);
      printf("hi : %d, List[%d] = %d\n", hi, hi, List[hi]);

      comparisons++;

      // probe the mID point 
      mID = lo + (((double)(hi - lo) / (List[hi] - List[lo])) * (data - List[lo]));
      printf("mID = %d\n",mID);

      // data found 
      if(List[mID] == data) {
         index = mID;
         break;
      } else {
         if(List[mID] < data) {
            // if data is larger, data is in upper half 
            lo = mID + 1;
         } else {
            // if data is smaller, data is in lower half 
            hi = mID - 1;
         }
      }               
   }

   printf("
Total comparisons made: %d", --comparisons);
   return index;
}

int main() {
   //find location of 33
   int location = find(33);

   // if element was found 
   if(location != -1)
      printf("
Element found at location: %d" ,(location+1));
   else
      printf("Element not found.");

   return 0;
}