Generic Algorithms- A simple example #includesalgorithm> #include<vector> bool Have Elem( const vector<int> &vec, int search value) int max value= max element(vec begin((, vec. endo); if (max value search value) i cout<<No enough elements'"<< endl return false; j vector<int> temp( vec size); copy(vec begin(), vec endo, temp. begin(); / copy a new vector for sorting sort(temp. begin(), temp. endo // needed for binary search return binary search( temp. begin(), temp. endo, search value)Generic Algorithms – A simple example #include<algorithm> #include<vector> bool Have_Elem(const vector<int> &vec, int search_value) { int max_value = max_element(vec.begin(), vec.end()); if (max_value < search_value) { cout << “No enough elements” << endl; return false; } vector<int> temp(vec.size()); copy(vec.begin(), vec.end(), temp.begin()); //copy a new vector for sorting sort(temp.begin(), temp.end()); //needed for binary search return binary_search(temp.begin(), temp.end(), search_value); }