class ShuzuDemo
{
/*
练习查找法
*/
public static void main(String[] args)
{
int[] arr ={1,5,7,11,14,17,19,20};//数组
int index = halfSearch_2(arr,2);//功能
System.out.println("index="+index);
}
public static int halfSearch(int[] arr,int key)
{
int max,min,mid;//定义三个变量
min = 0;
max = arr.length-1;
mid = (min+max)/2;
while (arr[mid]!=key)
{
if (key>arr[mid])
min=mid+1;
else if(key<arr[mid])
max=mid-1;
if (max<min)
return -1;
mid = (max+min)/2;
}
return mid;
}
public static int halfSearch_2(int[] arr,int key)
{
int max,min,mid;
min=0;
max=arr.length-1;