Binary Search (easy)

public class Solution {
    public static void main(String[] args) {
        System.out.println(search(new int[]{-1,0,3,5,9,12}, 9)); // 4
        System.out.println(search(new int[]{-1,0,3,5,9,12}, 2)); // -1
        System.out.println(search(new int[]{2,5}, 2)); // 0
        System.out.println(search(new int[]{5}, 5)); // 0

    }
    public static int search(int[] nums, int target) {
        //
    }
}

public static int search(int[] nums, int target) {
    int endIndex = nums.length - 1;
    int startIndex = 0;
    int mid;
    
    while (startIndex <= endIndex) {
        mid = (endIndex + startIndex) / 2;
        
        if(target == nums[mid]) {
            return mid;
        } else if (target > nums[mid]) {
            startIndex = mid + 1;
        } else {
            endIndex = mid - 1;
        }
    }
    
    return -1;
}