二分查找法练习

package com.company.test3;

import org.w3c.dom.ls.LSOutput;

public class MyBinarySearchDemo {
    public static void main(String[] args) {
        int [] arr = {1,2,3,4,5,6,7,8,9};
        int number = 3;

        int index =binarySearchForIndex(arr,number);
        System.out.println(index);



    }
    private static int binarySearchForIndex(int[] arr, int number) {
        int min =0;
        int max =arr.length-1;
        while (min<=max){
            int mid=(min+max)>>1;
            if(arr[mid]>number){
                max=mid-1;
            }
            else if(arr[mid]<max){
                min = mid+1;
            }
            else {
                return mid;
            }
        }
        return -1;
    }
}