#include <iostream>
#include <algorithm>
int main() {
int arr[] = {12, 3, 5, 7, 9, 2, 6, 8, 99, 1, 0};
int size = sizeof(arr) / sizeof(arr[0]);
std::vector<int> v(arr, arr + size);
std::sort(v.begin(), v.end());
int to_find = 8;
if (std::binary_search(v.begin(), v.end(), to_find))
std::cout << "found";
else
std::cout << "not found";
return 0;
}
/*
run:
found
*/