X439: Binary Search (non-recursive)

Complete the following binary search method. Find the number num in the array array. Return -1 if the number is not found. You may assume the array is properly ordered.

Examples:

binarySearch({1,4,7},7) -> 2

binarySearch({2,6,6,8,80},6) -> 2

Your Answer:

Answer code

public int binarySearch(int[]array, int num) {
  int low = 0;
  //low range
  int high = array.length -1; //high range 
  int mid; //mid range
  while ()  //while low is less than or equal to high
  {
    mid = ; //set middle range to be (low + high) /2
    if () { //if the array in the middle range = input number
      //return mid range

    }
    else
      if () { //if the array in the middle range > input number
        //set the high value to be the mid value minus 1

      }
      else
      {
        //set low value to be mid value plus one

      }     
  }
  //return -1 here because that would mean that the number is not found in the loop
}

​x
 
public int binarySearch(int[]array, int num) {
  int low = 0;
  //low range
  int high = array.length -1; //high range 
  int mid; //mid range
  while ()  //while low is less than or equal to high
  {
    mid = ; //set middle range to be (low + high) /2
    if () { //if the array in the middle range = input number
      //return mid range
​
    }
    else
      if () { //if the array in the middle range > input number
        //set the high value to be the mid value minus 1
​
      }
      else
      {
        //set low value to be mid value plus one
​
      }     
  }
  //return -1 here because that would mean that the number is not found in the loop
}
​

Reset

Next exercise

Feedback

Your feedback will appear here when you check your answer.