Binary Search Java

gistfile1.java

int binSearch(int key, int &lo, int &hi) {
    if(hi < lo)
       return NOT_FOUND;  //RETURN with V = 1   
    int mid = (lo+hi) / 2;
    if(key == array[mid])
       return mid;
    else if(key < array[mid]) // go left
       return binSearch(key, lo, mid-1); // left
    else
       return binSearch(key, mid+1, hi); // right
    }