二分法进阶

一个二维数组，奇数行递增，偶数行递减。在这个二维数组中查找这个数。

#include <stdio.h>

int find1(int *a,int size,int target)
{
	int low = 0,high = size - 1;
	int mid = 0;
	//{0,1,2,3,4,5,6,7,8,9},
	while(low <= high){
		mid = (low + high) / 2;
		if(a[mid] == target){
			return mid;
		}else if(a[mid] < target){
			low = mid + 1;
		}else{
			high = mid - 1;
		}
	}	
	return -1;
}

int find2(int *a,int size,int target)
{
	int low = 0,high = size - 1;
	int mid = 0;
	//{19,18,17,16,15,14,13,12,11,10}
	while(low <= high){
		mid = (low + high) / 2;
		if(a[mid] == target){
			return mid;
		}else if(a[mid] < target){
			high = mid - 1;
		}else{
			low = mid + 1;
		}
	}	
	return -1;
}


int main()
{
	int arr[2][10] = {
						{0,1,2,3,4,5,6,7,8,9},
						{19,18,17,16,15,14,13,12,11,10}
					};
	
	int row = 2,col = 10;
	int i = 0,ret = 0;
	int target1 = 9,target2 = 10;
	
	for(i = 0;i < row;i++){
		if(i %2 == 0){
			ret = find1(arr[i],col,target1);
			if(ret < 0){
				printf("row:%d,not find target1:%d \n",i,target1);
			}else{
				printf("row:%d,find target1:%d,index:%d \n",i,target1,ret);
			}
		}else{
			ret = find2(arr[i],col,target2);
			if(ret < 0){
				printf("row:%d,not find target2:%d \n",i,target2);
			}else{
				printf("row:%d,find target2:%d,index:%d \n",i,target2,ret);
			}
		}
	}
	
	return 0;
}