Java实现简单的二分法查找int数组中的某值

public static int binarySearch(int[] arr, int key,int fromIndex, int endIndex)
	{
		int low = fromIndex;
		int high = endIndex -1;

		while(low <= high)
		{
			int mid = (low + high) / 2;
			int midVal = arr[mid];

			if(key > midVal)
			{
				low = mid + 1;
			}
			else if(key < midVal)
			{
				high = mid -1;
			}
			else
			{
				return mid;//找到，返回该值索引
			}
		}
		return -1;//找不到，反回-1
		
	}

当然，此处int数组要是排好序的~~需要的朋友参考一下