java二分法代码摘要.doc

Java二分法代码 public class BinSearch{?????public static void main(String[] args){??????????int n = Integer.parseInt(args[0]);??????????int i = Integer.parseInt(args[1]);??????????int[] a = {5,12,18,19,24,51,56,60,70,90,100};??????? ? ??int start = 0;??????????int end = a.length-1;??????????int center = (start+end)/2;??????????if(n=a.length-1){???????????????for(int j=0;ja.length;j++){????????????????????if(i==a[j]){?????????????????????????while(start=center){??????????????????????????????if(a[center] == i){???????????????????????????????????System.out.println(a[center]+，这个数是在数组中的第+