Binary search your int array - Java Data Structure

Java examples for Data Structure:Binary Search

  1. HOME
  2. Java
  3. Data Structure
  4. Binary Search

Description

Binary search your int array

Demo Code


public class Main {
  public static boolean binarySearch(int arr[], int low, int high){
    int first = 0;
    int last = arr.length -1;
    while (last > first){
      int middle = first + (last - first)/2;
      if (arr[middle] >= low && arr[middle] <= high){
        return true;
      }//w ww . jav a 2  s .co  m
      else if (arr[middle] < low){
        first = middle + 1;
      }
      else
        last = middle -1;
      }
    return false;
  }

  public static void main(String[] args) {
    int [] shakNum={1,2,4,5,6,7,8,9,13,14,19,21};
    System.out.println(binarySearch(shakNum, 13, 1));
  }

}

Related Tutorials