Binary Search Code 

  int search(const vector<int> &nums, int key) {
    int n = int(nums.size());
    int low = -1;
    int high = n;

    while (high > low + 1) {
        int mid = low + (high - low) / 2;

        if (nums[mid] >= key) {
            high = mid;
        } else {
            low = mid;
        }
    }

    if (high != n && nums[high] == key) {
        return high;
    }

    return -1;
}
  
  static int search(int[] nums, int key) {
    int low = -1;
    int high = nums.length;

    while (high > low + 1) {
        int mid = low + (high - low) / 2;

        if (nums[mid] >= key) {
            high = mid;
        } else {
            low = mid;
        }
    }

    if (high != nums.length && nums[high] == key) {
        return high;
    }

    return -1;
}

 

Code on GitHub

See the implementation code for Binary Search algorithm.

Last updated 11 May 2025, 02:05 +0500 . history