1 介绍
2 实现
package binarysearchnoresursion;
/**
* @author Darling yu
* @version 1.0
* @date 2022/2/17 23:13
*/
public class BinarySearchNoRecursion {
public static void main(String[] args) {
int[] arr = {1, 3, 8, 10, 11, 67, 100};
// int index=binarySearch(arr,1);//0
// int index=binarySearch(arr,100);//6
// int index=binarySearch(arr,8);//2
int index = binarySearch(arr, -8);//-1
System.out.println(index);
}
/**
* 二分查找的非递归实现
*
* @param arr 待查找的数组,arr是升序排序
* @param target 需要查找的数
* @return 返回对应下标,没有找到则返回-1
*/
public static int binarySearch(int[] arr, int target) {
int left = 0;
int right = arr.length - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (arr[mid] == target) {
return mid;
} else if (arr[mid] > target) {//向左边查找
right = mid - 1;
} else {//向右查找
left = mid + 1;
}
}
return -1;
}
}