binary search algorithm cpp code example

Example 1: 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;
}

Example 2: c++ binary search

//requires header <algorithm> for std::binary_search
#include <algorithm>
#include <vector>

bool binarySearchVector(const std::vector<int>& vector,
                       	int target) {
  //this line does all binary searching
  return std::binary_search(vector.cbegin(), vector.cend(), target);
}

#include <iostream>

int main()
{
    std::vector<int> haystack {1, 3, 4, 5, 9};
    std::vector<int> needles {1, 2, 3};
 
    for (auto needle : needles) {
        std::cout << "Searching for " << needle << std::endl;
        if (binarySearchVector(haystack, needle)) {
            std::cout << "Found " << needle << std::endl;
        } else {
            std::cout << "no dice!" << std::endl;
        }
    }
}