使用泛型实现二分查找

public static <T extends Comparable <? super T>> int binarySearch(T [] array,T key){

int low = 0;
int high = array.length-1;
while(low <= high){
int mid = (low + high)/2;
if(array[mid].compareTo(key)<0){
low = mid + 1;
}else if(array[mid].compareTo(key)>0){
high = mid - 1;
}else{
return mid;
}
}
return -1;
}本文出自 “有思想的代码” 博客，请务必保留此出处http://wujuxiang.blog.51cto.com/2250829/410763