二分查找

int BinarySearch(const int *a,const int len, int key)
{
	int mid   = 0;
	int left  = 0;
	int right = len-1;
	
	while(left<=right)
	{
		mid = left + (right - left) / 2;
		
		if(a[mid] < key)
           left = mid + 1;
        else if(a[mid] > key)
      	   right = mid - 1;
        else
        	return mid;
		
	}
	
	return -1;
}