编程珠玑札记一

编程珠玑笔记一
关于二分法算法实现：
   

   public static int binarySearch(int [] intArr,int searchfor){int index =-1;int arrLen = intArr.length;int midIdx =arrLen/2;int low =0;int higth =arrLen-1;while(low <=higth){if(intArr[midIdx]==searchfor){index =midIdx;break;}else if(intArr[midIdx]>searchfor){higth =midIdx-1;}else{low = midIdx +1;}midIdx =(higth+low)/2;}return index;}