摘要： public class BinarySearch {public BinarySearch() {super();}/*** Java二分法查找* @param a* @param key* @return*/public static int binarySearch(int[] a, int key) {if(a.length==0)return -1;//开始位置int first = 0;//结束位置int last = a.length-1;//中间位置int mid;//如果开始时,小于则结束.while(firstkey)last = mid-1;//如果小于key,则在右边i 阅读全文