java底层二分查找

public class TwoSearch {
        public static void main(String[] args) {
            int [] a = { 5, 11, 55, 24, 36, 47, 59, 66};
            //先排序
            Arrays.sort(a);
            //System.out.println(Arrays.toString(a));
            Scanner sc = new Scanner(System.in);
            System.out.println("请输入目标元素");
            int target = sc.nextInt();

            int s = 0, e = a.length - 1, m = 0;

            while(s<=e) {
                m = (s + e) / 2;
                if(target == a[m]) {
                    System.out.println("找到");
                    break;
                }else if(target > a[m]) {
                    s = m+1;

                }else {
                    e = m-1;
                }
            }

        }
    }