算法分析与设计-03-二分搜索算法

二分搜索算法：

#include <stdio.h>
template<class Type>
int BinarySearch(Type a[],const Type& x, int n)
{
int left=0;
int right=n-1;
while(left<=right)
{
int middle=(left+right)/2;
if(x==a[middle])return middle;
if(x>a[middle])left=middle+1;
else right=middle-1;
}
return -1;
}
int main()
{
int i, val, ret;
    int a[8]={-32, 12, 16, 24, 36, 45, 59, 98};
    for(i=0; i<8; i++)
        printf("%d\t", a[i]);
    printf("\n请输人所要查找的元素：");
    scanf("%d",&val);
    ret = BinarySearch(a,val,8);
    if(-1 == ret)
        printf("查找失败 \n");
    else
        printf ("查找成功 \n");
        printf("ret:%d\n",ret);
    return 0;
}

运行效果：