递归实现二分查找。 class BinarySearch{ public int search(int[] a,int low,int high,int m){ if(low>high){ return -1; } int mid=(low+high)/2; if(m==a[mid]){ return mid; } else if(m<a[mid]){ return search(a,low,mid-1,m); } else{ return search(a,mid+1,high,m); } } }