Question

JAVA Algorithms course need help completing this method using binary search thank you in advance.

-------------------------------------------------------------------------------------------------

/**
A class for executing binary searches in an array.
*/
public class BinarySearcher
{
/**
Finds a value in a range of a sorted array, using the binary
search algorithm.
@param a the array in which to search
@param low the low index of the range
@param high the high index of the range
@param value the value to find
@return the index at which the value occurs, or -1
if it does not occur in the array
*/
public static int search(int[] a, int low, int high, int value)
{
     
}

Answer 1

/**
 A class for executing binary searches in an array.
 */
public class BinarySearcher {
  /**
   * Finds a value in a range of a sorted array, using the binary
   * search algorithm.
   *
   * @param a     the array in which to search
   * @param low   the low index of the range
   * @param high  the high index of the range
   * @param value the value to find
   * @return the index at which the value occurs, or -1
   * if it does not occur in the array
   */
  public static int search(int[] a, int low, int high, int value) {
    int mid;
    if(low<=high){
      mid = (low+high)/2;
      if(a[mid] == value){
        return mid;
      }
      else if(a[mid] < value){
        return search(a,mid+1,high,value);
      }
      else{
        return search(a,low,mid-1,value);
      }
    }
    return -1;
  }
}