折半查找的实现

折半查找的实现：

void HalfFind(int num[],int target)
{
     int middle,low,hight;
     low=0;hight=7;//initial low and hight
     middle=(low+hight)/2;
     while(low<=hight)
     {
        middle=(low+hight)/2;
        if(target==num[middle])            
              {
               printf("find it");
               break;
               }
           
        else
        {     
        if(target
  
   num[middle])
              low=middle+1;//search right-half part
        }
     }