Java实例——用二分法在数组中找元素

import java.util.Arrays;
import java.util.Scanner;

public class Testdichotomy {
    public static void main(String[] args) {
        //生成一个元素是随机数的长度为10的整型数组
        int[]a=new int[10];
        for (int i = 0; i < a.length; i++) {
            a[i]=(int)(Math.random()*100);
        }
        Arrays.sort(a);     //排序
        System.out.println(Arrays.toString(a));
        //初始化，键入查询值
        Scanner s = new Scanner(System.in);
        System.out.println("输入查询的数");
        int num = s.nextInt();
        int start = 0;
        int end = a.length - 1;
        int mid = (start + end) / 2;
        //不确定要循环多少次，用while和break配合
        while (true) {
            if (start < end) {
                if (a[mid] == num) {
                    System.out.println("找到，数为" + a[mid]+"下标为"+mid);
                    break;
                }
                if (a[mid] > num) {
                    end = mid - 1;
                }
                if (a[mid] < num) {
                    start = mid + 1;
                }
                mid = (start + end) / 2;
            }
            if (start == end) {
                if (a[end] == num) {
                    System.out.println("找到，数为" + a[mid]+"下标为"+mid);
                    break;
                } else {
                    System.out.println("没找到");
                    break;
                }
            }

        }

    }
}