binarysearchexception

public static int binarySearch(int numbers[], int key) {
    
    int mid;
    int low = 0;
    int high = numbers.length - 1;
   
    while (low <= high) {
        mid = (low + high) / 2;
        if (numbers[mid] > key) {
            high = mid - 1;
        } else if (numbers[mid] < key) {
            low = mid + 1;
        } else {
            return mid;
        }
    }

if(key > -1){
			key = key;
			return key;
		}else{
			if(numbers[(low + high)/2] < key){
				key = (low + high/2);
			}else{
				for(int i = (low + high)/2; i > -1; i--){
					if(numbers[i] == key){
						key = i;
						break;
					}else if(numbers[i] < key){
						key = i;
						break;
					}else{
						key = key;
					}
				}
			}
		}
		return key;