#N704. Binary Search
problem link=>https://leetcode.com/problems/binary-search/

#solution

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

‼️Implementation of Bineary Search to the problems