Java一个数组冒泡排序后二分查找——查询数是否在数组内

package test;

import java.util.*;
public class exam {
	public static void main(String args[])
	{
		int start=0;
		int end,middle;
		int a[]= {12,45,67,89,123,-45,67};
		int N=a.length;
		//冒泡排序
		for(int i=0;i<N;i++)
		{
			for(int j=i+1;j<N;j++)
			{
				if(a[j]<a[i])
				{
					int t=a[j];
					a[j]=a[i];
					a[i]=t;
				}
			}
		}
		int k=0;
		for(k=0;k<N;k++)
			System.out.print(a[k]+" ");
			
		Scanner reader=new Scanner(System.in);
		System.out.println("输入一个整数，程序判断是否在数组中：");
		int number = reader.nextInt();
		int count=0;
		end=N;
		middle=(start+end)/2;
		while(number!=a[middle])
		{
			if(number>a[middle])
				start=middle;
			else if(number<a[middle])
				end=middle;
			middle=(start+end)/2;
			count++;
			if(count>N/2)
				break;
		}
		if(count>N/2)
			System.out.printf("%d不在数组中。\n", number);
		else
			System.out.printf("%d在数组中。\n", number);
		
		
		
	
	}

}