Binary Search in Java

public static int binarySearch(final int[] inputSortedData, final int searchElement) {
        int minLeft = 0;
        int maxRight = inputSortedData.length - 1;
        while ( minLeft <= maxRight ) {
            final int middleElement = (minLeft + maxRight) / 2;
            if (searchElement == inputSortedData[middleElement]) { return middleElement + 1; }
            if (searchElement < inputSortedData[middleElement]) { maxRight = middleElement - 1; }
            if (searchElement > inputSortedData[middleElement]) { minLeft = middleElement + 1; }
        }
        return -1;
    }