public class BinarySearch { public static void main(String... arg0){ int[] A = {1,2,3,5,6,7,8}; System.out.print(binarySearch(A,8,0,A.length)); } private static int binarySearch(int[] A,int value,int start,int end) { if (start > end) return -1; int mid = (end + start) / 2; if (value < A[mid]) { return binarySearch(A, value, start, mid-1); } else if (value > A[mid]) { return binarySearch(A, value, mid+1, end); }else { return mid; } } }
转载于:https://my.oschina.net/zqx123/blog/740903