JavaAlgorithms/Searches/PerfectBinarySearch.java

package Searches;

class PerfectBinarySearch {

  static int binarySearch(int[] arr, int target) {
    int low = 0;
    int high = arr.length - 1;

    while (low <= high) {
      int mid = (low + high) / 2;

      if (arr[mid] == target) {
        return mid;
      } else if (arr[mid] > target) {
        high = mid - 1;
      } else {
        low = mid + 1;
      }
    }
    return -1;
  }

  public static void main(String[] args) {
    PerfectBinarySearch BinarySearch = new PerfectBinarySearch();
    int[] array = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    assert BinarySearch.binarySearch(array, -1) == -1;
    assert BinarySearch.binarySearch(array, 11) == -1;
  }
}