704. Binary Search java

https://leetcode.com/problems/binary-search/description/?envType=study-plan&id=algorithm-i

Binary Search - LeetCode

class Solution {
    public int search(int[] nums, int target) {
        int start = 0;
        int end = nums.length-1;
        int idx = -1;
        
        while (start <= end) {
            int mid = (start + end)/2;
            if (nums[mid] == target) {
                idx = mid;
                break;
            }

            if (target > nums[mid]) {
                start = mid + 1;
            } else {
                end = mid -1;
            }
        }
        return idx;
    }
}

https://leetcode.com/problems/binary-search/?envType=study-plan&id=algorithm-i 

Binary Search - LeetCode