一：折半查找法：
public static <T extends Comparable<T>>int binarySezrch(T[] array,T key){
int start = 0;
int end = array.lenth - 1;
while(start<=end){
int mid = (end-start)/2+start //防止(end+start)/2的end+start的范圍超出int表示范圍
if(array[mid].equals(key)){
return mid;
}else if(array[mid].compareTo(key)>0){
end = mid-1;
}else{
start = mid+1;
}
}
return -1;
}
或者使用下面的方法
public static <T> int binarrySearch(<T>array,T key,Comparator<T> comp ){
int start = 0;
int end = array.lenth-1;
while(start<=end){
int mid=(start + end)>>>1;
if(array[mid].equals(key)){
return mid;
}else if(comp.compare(array[mid],key>0)){//邏輯右移 不帶符號位右移
end = mid-1;
}else{
start = mid+1
}
}
}
