binarysearch in cpp code example

Example 1: how to do binary search in c++ using STL

// BY shivam kumar KIIT
#include<bits/stdc++.h>
usind namespace std;
int main()
{
	int arr[]={10,2,34,2,5,4,1};
  	sort(arr,arr+7);//sort array in ascending order before using binary search
  	binary_search(arr,arr+7,10);//return 1 as element is found
  	binary_search(arr,arr+7,3);//return 0 as element is not found
  	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;
        }
    }
}