public class Solution {
    public int binarySearch(int[] numbers, int target) {
        int start = 0;
        int end = numbers.length;
        while (start < end) {
            int mid = (start + end) / 2;
            if (numbers[mid] == target) {
                return mid;
            }
            if (numbers[mid] > target) {
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        return -1;
    }
}