Binary search implementation for a primitive type in Java.

arrays.java

static int binarySearch(int[] arr, int key) {
    Object[] arrobj = new Object[arr.length];
    for (int i = 0; i < arr.length; i++)
        arrobj[i] = arr[i];
    Object keyobj = key;
    return binarySearch(arrobj, keyobj);
}