package dataStruct.常用算法;
public class 二叉排序树 {
public static void main(String[] args) {
int[] arr = {1,3,4,5,6,8,9,12,45};
System.out.println(binarySearch(arr,4));
}
public static int binarySearch(int[] arr,int target){
int left = 0;
int right = arr.length;
while (left <= right){
int mid = (left + right)/2;
if (arr[mid] == target){
return mid;
}else if (arr[mid] < target){
left = mid + 1;
}else {
right = mid - 1;
}
}
return -1;
}
}
Java实现二分查找法(非递归)
最新推荐文章于 2024-09-24 09:19:59 发布