BinarySearch.java

package project;

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

        int high = arr.length - 1;
        int low = 0;
        int key = 3;
        int mid = 0;
        while (low + 1 < high){
            mid = (high + low) / 2;
            if (key == arr[high]){
                mid = high;
                break;
            }
            else if (key == arr[low]){
                mid = low;
                break;
            }
            else if (key > arr[mid]){
                low = mid;
            }

            else {
                high = mid;
            }
            System.out.println("mid: " + mid);
        }
        System.out.printf("%d found at: arr[%d]\n", key, mid);
        //System.out.println("HEY");
    }
}