二分查找法

package a_od_test;

import java.util.Arrays;

/*
java实现二分查找法
输入:
int[] arr= {3,4,8,15,7}
int target = 7
输出:
找到该元素 7
 */
public class Main42_2 {
    public static void main(String[] args) {
        int[] arr = {3,4,8,15,7};
        int target = 7;
        Arrays.sort(arr);
        binarySearch(target, arr);
    }

    public static void binarySearch(int target, int[] arr) {
        int left = 0;
        int right = arr.length - 1;
        boolean flag = false;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (arr[mid] == target) {
                flag = true;
                break;
            } else if (arr[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        if (flag) {
            System.out.println("找到该元素" + target);
        } else {
            System.out.println("未找到该元素" + target);
        }
    }
}