package search;
//折半查找算法
public class Zheban
{
public static void main(String[] args)
{
int target=5;
//设置数组
int[] values=new int[11];
for(int i=0;i<11;i++)
{
values[i]=i+1;
}
//开始折半查找
int low=0;
int hight=values.length;
int mid=(low+hight)/2;
while(values[mid]!=target)
{
if(target>values[mid])
{
low=mid+1;
}else if(target<values[mid])
{
hight=mid-1;
}
mid=(low+hight)/2;
}
System.out.println(mid);
}
}