#704.Binary Search [LeetCode Grind 75 in Java]

class Solution {
    public int binarySearch(int[] nums, int target) {

        int left = 0;
        int right = nums.length - 1;

        while(left <= right){
            int mid = left + (right - left) / 2;
            if(nums[mid] == target) return mid;

            if(nums[mid] > target) right = mid - 1;
            else left = mid + 1; 
        }
        return -1;

    }
}