find upper index using binary search code example

Example 1: binary_search in vector in c++

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
//defining the comparator function returns true or false
//not for binary search..
bool f(int x, int y){
	return x>y; //for decreasing order
}
	
int main() {
	
	vector<int> A ={ 11,2,3,14 };
	cout<<A[1]<<endl;//2
  
	sort(A.begin(), A.end()); // sort in order to perform binary search
	cout<<A[1]<<endl;//3 after sorting
	
	bool present = binary_search(A.begin(), A.end(), 3);
	cout<<present<<endl;//will return true
  
	present = binary_search(A.begin(), A.end(), 5);
	cout<<present<<endl;//will return false
  
	A.push_back(100);//inserting new element from end
  
	present = binary_search(A.begin(), A.end(), 100);
	cout<<present<<endl;
  
   	A.push_back(100);
	A.push_back(100);
	A.push_back(100);
	A.push_back(121);
	
	//give me the iterator pointing to first element >= 100
	vector<int>::iterator it = lower_bound(A.begin(), A.end(), 100);
	//you can also use auto as c++ will see that a lower_bound is performed
	//and it will figur it out that it is an iterator of vector<int>
	//auto it = lower_bound(A.begin(), A.end(), 100);
	//auto it2 = upper_bound(A.begin(), A.end(), 100);
	
	
	
	//give me an iterator pointing to first element >100
	vector<int>::iterator it2 = upper_bound(A.begin(), A.end(), 100);
	
	//print the content of it and it2
	cout<<*it<<" "<<*it2<<endl;
	
	//give me the number of hundreds(100)
	cout<<it2-it<<endl; //4 it subtracts the indices 
	
	
	//soritng the vector in reverse order
	//use method overloading with sort by passing a comparator function 
	//to control the ordering
	sort(A.begin(), A.end(), f);
	
	//now print the sorted vector using iterator
	vector<int>::iterator it3;
	
	for (it3 =A.begin(); it3!= A.end(); it3++){
		cout<<*it3<<" ";
	}
	cout<<endl;
	
	//A shorter code for the above will be
	for(int x: A){
		//x++ wont change the vector content it will only print the changed one
		cout<<x<<" ";
	}
	cout<<endl;
	
	//to change the vector content while iterating
	//iterate it by referance by using &x
	for(int &x: A){
		x++;
		cout<<x<<" ";
	}
	cout<<endl;
  
	return 0;
}

Example 2: binary search function in c++

#include<iostream>
using namespace std;
int binarySearch(int arr[], int p, int r, int num) {
   if (p <= r) {
      int mid = (p + r)/2;
      if (arr[mid] == num)
      return mid ;
      if (arr[mid] > num)
      return binarySearch(arr, p, mid-1, num);
      if (arr[mid] > num)
      return binarySearch(arr, mid+1, r, num);
   }
   return -1;
}
int main(void) {
   int arr[] = {1, 3, 7, 15, 18, 20, 25, 33, 36, 40};
   int n = sizeof(arr)/ sizeof(arr[0]);
   int num = 33;
   int index = binarySearch (arr, 0, n-1, num);
   if(index == -1)
   cout<< num <<" is not present in the array";
   else
   cout<< num <<" is present at index "<< index <<" in the array";
   return 0;
}