zheban.cpp

来自「包含了几个常用的数据结构算法:KMP算法、单链表的合并、快速排序和折半查找算法」· C++ 代码 · 共 32 行

#include <stdio.h>
//#define N 5
int search(int rectab[],int n,int key)//折半查找 
{int low,high,mid;
 low=1;high=n;
 while(low<=high)
  {mid=(low+high)/2;
   if(key==rectab[mid])
    return mid;
  else
    if(key<rectab[mid])
      high=mid-1;
    else low=mid+1;
  }
return 0;//查找失败 
}
int main()
{int N;//输入数字个数 
 printf("how many number you wante input:\n");
 scanf("%d", &N);
 int key,rectab[N],i;
 printf("input data:\n") ;
 scanf("%d",&key);
 printf("input data list:\n");
 for(i=1;i<=N;i++)
 scanf("%d",&rectab[i]);
 printf("the position is %d\n",search(rectab,N,key));
 getchar();
 getchar();
}