BinarySearch的java实现

 给出了循环和递归两种实现

package com.test1;
public class BinarySearch {
	
	//return index of value to be found,return -1 if not found
	//assuming that the array to search is sorted
	
	//loop implement
/*	public static int binarySearch(int[] a,int toFind,int low,int high) {
		if (low>high||toFinda[high]) {
			return -1;
		}
		int mid;
		while(low<=high){
			mid=(low+high)/2;
			if (toFind==a[mid]) {
				return mid;
			}
			else if (toFindhigh||toFinda[high]) {
			return -1;
		}
		int mid=(low+high)/2;
		if (toFind==a[mid]) {
			return mid;
		}
		else if (toFind