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