二分搜索

二分搜索的对象是已排序的数组

int n =in.nextInt(); //要查找的数
int nn =in.nextInt();
int []a=new int[n];
for(int i=0;i<n;i++) //数组
a[i]=i;
int high=n-1;int lower=0;
while(high>=lower)
{
int mid=(high+lower)/2;
if(nn>a[mid])lower=mid+1;
else if(nn<a[mid])high=mid-1;
//if(nn==a[mid])
else
{System.out.println(mid);
System.exit(0);
}

	}