数组练习题-二分查找

数组中的元素是有序的，二分查找，效率更高

package array;

/**
 * @author 苗晓强
 * @date 2023/7/27 14:50
 * 数组元素是有序的，二分查找，效率更高
 */
public class BinarySearchTest {
    public static void main(String[] args) {
        int [] arrays = {1,2,3,4,5,6,7,8,9,10};
        int target = 5;
        int head = 0;
        int end = arrays.length -1;
        boolean flag = false;
        while (head <= end){
            int middle = (head + end)/2;
            if (target == arrays[middle]){
                System.out.println("找到了" + target + "，对应的位置是：" + middle);
                flag = true;
                break;
            }else if (target > arrays[middle]){
                head = middle + 1;
            }else {
                end = middle -1;
            }
        }
        if (!flag){
            System.out.println("不好意思，未找到！");
        }
    }
}