二分查找法

示例：

public static <T extends Comparable<? super T>> boolean binarySearch
(T[] data,int min,int max,T target) {
boolean found = false;
int midpoint = (min + max) / 2;
if(data[midpoint].compareTo(target) == 0) {
found = true;
}else if(data[midpoint].compareTo(target) > 0) {
if(min <= midpoint-1) {
found = binarySearch(data,min,midpoint-1,target);
}
}else {
found = binarySearch(data,midpoint+1,max,target);
}
return found;
}