704. Binary Search.java

class Solution {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        int mid = left +(right-left)/2;

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