/**
* 折半查找
* @param <AnyType>
* @param arr
* @param x
* @return
*/
public static <AnyType extends Comparable<? super AnyType>> int BinarySearch(AnyType[] arr, AnyType x) {
int low = 0, high = arr.length - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (arr[mid].compareTo(x) < 0)
low = mid + 1;
else if (arr[mid].compareTo(x) > 0)
high = mid - 1;
else
return mid;
}
return -1;
}
折半查找
最新推荐文章于 2022-08-08 07:30:00 发布