二分查找算法的java实现

package OberverDesignPattern;

/**
 * 二分查找算法的实现，二分查找针对有序数据的查找
 * @author mhzhang
 *
 */
public class MiddleSearch {
	public static void main(String[] args){
		int[] Arr = {1,4,7,8,9,10};
	    int  targetIndex = 	middleSearch(Arr,9);
	    System.out.println(targetIndex);
	}
	
	public static int middleSearch(int[] intArr,int value){
		int   fontIndex = 0;
		int   lastIndex = intArr.length-1;//4
		int   midValue =0;
		//[1,4,7,9,9,10]
		//2
		while( midValue != value){
			if(value > midValue ){
				fontIndex = (fontIndex+lastIndex)/2;
			}else{
				lastIndex = (fontIndex+lastIndex)/2;
			}
			midValue = intArr[(fontIndex+lastIndex)/2];
		}
		return (fontIndex+lastIndex)/2;
	}
}