数组的排序与查找
public class Work {public static void main(String[] args){System.out.println("排序后的数组为：");Sorting S=new Sorting();S.work();System.out.println("查找数组中的元素");Search S1=new Search();S1.search(S.xArray);}}public class Sorting {int xArray[]={12,45,67,89,123,-45,67};int L=xArray.length;int M=0;public void work(){for(int j=0;j<L;j++){for(int i=0;i<L-j-1;i++){if(xArray[i]<xArray[i+1]){M=xArray[i];xArray[i]=xArray[i+1];xArray[i+1]=M;} } }for(int i=0;i<L;i++){System.out.print(xArray[i]+" ");} }}import java.util.*;public class Search {public void search(int[]xArray){int start=0,end,middle;System.out.println("请输入数字：");Scanner scanner=new Scanner(System.in);int number=scanner.nextInt();int count=0;int L=xArray.length;end=L;middle=(start+end)/2;while(number!=xArray[middle]){if(number<xArray[middle])start=middle;else if(number>xArray[middle])end=middle;middle=(start+end)/2;count++;if(count>L/2)break;}if(count>L/2)System.out.println(number+" 不在数组中");elseSystem.out.println(number+" 在数组中");}}