二分法查找数组里的元素

import java.util.Scanner;

/**
 * 二分法查找(必须是有序的数组)
 */
public class Main {
    public static void main(String[] args) {
        Scanner f=new Scanner(System.in);
        System.out.print("请输入您想查找的值:   ");
        int x=f.nextInt();

        int[] nums1={-9867,-987,-654,-43,1,2,3,4,58,87,99,134,875,1234};
        int max=nums1.length-1;
        int min=0;
        int l=0;
        while(min<=max){
            int mid= (max+min)/2;
            if (nums1[mid]==x){
                System.out.println("找到了指定元素,位置为:"+mid);
                 l=1;
                break;
            }else if (nums1[mid]>x){
                max=mid-1;
            }else{
                min=mid+1;
            }

        }

if (l==0){
    System.out.println("未找到您要找的数");
}
    }

}