简单折半查找

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int size = sc.nextInt();
        int[] list = new int[size+1];
        for(int num = 1 ; num<= size ;num++){
            list[num]= sc.nextInt();
        }
        for (int i =1;i<=size;i++) {
            System.out.println(list[i]);
        }
        int value = sc.nextInt();
        int low = 1 ;
        int high = list.length-1;
        int mid = 0 ;
        int time = 0;
        while (low<=high){
            time++;
            mid = (low + high)/2;
            if(list[mid]==value){
                System.out.println("located on "+mid);
                break;
            }
            else if(list[mid]>value){
                high = mid-1;
            }
            else {
                low = mid +1;
            }
        }
        System.out.println("compare "+time+" times");
        sc.close();
    }
}