Binary Search in Java

Search.java

/*
 * A binary search algorithm implementation in Java
 */

public class MyBinarySearch {
    public static void main(String[] args) {
        int[] numbers = {2, 12, 15, 17, 27, 29, 45};
        int targetValue = 17;
        System.out.println(binarySearch(numbers, targetValue));
    }

    static int binarySearch(int[] numbers, int targetValue) {
        int startIndex = 0;
        int endIndex = numbers.length - 1;

        while (startIndex <= endIndex) {
            int middleIndex = startIndex + (endIndex - startIndex) / 2;

            if (numbers[middleIndex] > targetValue)
                endIndex = middleIndex - 1;
            else if (numbers[middleIndex] < targetValue)
                startIndex = middleIndex + 1;
            else
                return middleIndex;
        }
        return -1;
    }
}