算法很美--查找排序（上）--2.7二分查找的迭代模式

二分查找基本思想

1.找mid

2.将目标值与mid比较，目标值大了，去右侧找；目标值小了，去左侧找，目标值相同，返回mid的下标

3.将新的mid与目标值比较

package 二分递归查找;

public class 顺序二分递归 {

        //顺序查找
	public static int a1(int[] arr,int find)
	{
		for(int i = 0;i < arr.length;i ++)
		{
			if(arr[i] == find)
			{
				return i + 1;
			}
		}
		return -1;
	}
	//二分查找迭代模式
	public static int a2(int[] arr,int fine)
	{
		int begin = 0;
		int last = arr.length - 1;
		//int mid = (begin + last) >> 1;
		int mid = last + ((begin - last) >> 1);
		while(begin < last)
		{
			
			if(fine < arr[mid])
			{
				last = mid - 1;
				//mid = (begin + last) >> 1;
				mid = last + ((begin - last) >> 1);
			}
			else if(fine > arr[mid])
			{
				begin = mid + 1;
				//mid = (begin + last) >> 1;
				mid = last + ((begin - last) >> 1);
			}
			else
			{
				return mid + 1;
			}
		}
		return -1;
	}
	//二分查找递归模式
	public static int a3(int[] arr,int begin,int last,int find)
	{
		if(begin >= last)
		{
			return -1;
		}
		int mid = last + ((begin - last) >> 1);
		if(find < arr[mid])
		{
			return a3(arr,begin,mid - 1,find);
		}
		else if(find > arr[mid])
		{
			return a3(arr,mid + 1,last,find);
		}
		else
		{
			return mid;
		}
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int arr[] = {1,23,54,56,57,58,59,60,65,69};
		System.out.println(a1(arr,5));
		System.out.println(a2(arr,54));
		System.out.println(a3(arr,0,arr.length - 1,54));
	}
}