BinarySearch.java

int binarySearch(int dataCollection[], int element) {
  int left = 0, right = dataCollection.length - 1;
  while (left <= right) {
    int mid = left + (right - left) / 2;

    // Verify if element is present at mid
    if (dataCollection[mid] == element)
      return mid;

    // If element greater, ignore left half
    if (dataCollection[mid] < element)
      left = mid + 1;

    // If element is smaller, ignore right half
    else
      right = mid - 1;
  }
  // Element was not present
  return -1;
}