二分查找法

用二分法查找某个数：

int search(int array[],int len,int value)
{
	int begin = 0;
	int end = len - 1;
	int middle;
	while(begin<end)
	{
		middle = (begin+end)/2;
		if(value>array[middle])
			begin = middle+1;
		else if(value<array[middle])
			end = middle-1;
		else
			return middle;
	}
	return -1;
}
void main()
{
	int a = {1,2,3,4,5}
	l = search(a,5,2);
	printf(" %d \n",l);
}