基本查找算法

1.有序数组的二分查找

/* binsearch函数: 在有序数组v[n]中查找x */

int binsearch(int x, int v[], int n)
{
int low, high, mid;
low = 0;
high = n -1;


while(low <= high)
{
mid =(low + high) / 2;
if(x < v[mid])
high = mid - 1;
else if(x > v[mid])
low = mid + 1;
else
return mid;

}




return -1; //数组中没有x
}