排序，查找（选择法）Java

public class Example2_5 {
	public static void main(String args[]){
		Fun a=new Fun();
		a.fun();
		}
}
import java.util.Scanner;
public class Fun {
	public void fun(){
	int start=0,end,middle;
	int[] intArray={12,45,67,89,123,-45,67};
	int N=intArray.length;
	for(int i=0;i<N;i++){
		for(int j=i+1;j<N;j++){
			if(intArray[j]<intArray[i]){
				int t=intArray[j];
				intArray[j]=intArray[i];
				intArray[i]=t;
			}
		}
	}
	Scanner scanner=new Scanner(System.in);
	System.out.println("输入一个整数，程序判断该数是否在数组中：");
	int number=scanner.nextInt();
	int count=0;
	end=N;
	middle=(start+end)/2;
	while(number!=intArray[middle]){
		if(number>intArray[middle])
			start=middle;
		else if(number<intArray[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);
	}
}