stupid binary search for my AP Computer Science class in High School

BinarySearch.java

public class BinarySearch {
    
    public int find(int[] arr, int v) {
        int i = 0;
        int b = (1 << (Double.doubleToLongBits(arr.length - 1) >> 51));
        
        while ((b >>>= 1) > 0) {
            if ((i | b) < arr.length && arr[i | b] <= v) i |= b;
            if (arr[i] == v) return i;
        }

        return -1;
    }
}