2.二分法
public class erfen{
public static void main(String []args){
int a[]={1,4,6,8,10,12,15,16};
int m=search(a,4,0,a.length-1);
System.out.println("查找的数在第"+m+"个位置");
}
public static int search(int a[],int m,int startpos,int endpos){//查找的数为m
int mid=(startpos+endpos)/2;
if(a[mid]==m){//如果查找的数刚好是中间那个数
return (mid+1);
}else if(a[mid]>m){
endpos=mid-1;
}else if(a[mid]<m){
startpos=mid+1;
}
return search(a,m,startpos,endpos);
}
}
public class erfen{
public static void main(String []args){
int a[]={1,4,6,8,10,12,15,16};
int m=search(a,4,0,a.length-1);
System.out.println("查找的数在第"+m+"个位置");
}
public static int search(int a[],int m,int startpos,int endpos){//查找的数为m
int mid=(startpos+endpos)/2;
if(a[mid]==m){//如果查找的数刚好是中间那个数
return (mid+1);
}else if(a[mid]>m){
endpos=mid-1;
}else if(a[mid]<m){
startpos=mid+1;
}
return search(a,m,startpos,endpos);
}
}