# Find the last subsequence (which should be the same as the first) : vector find « Vector « C++

Home
C++
 1 Bitset 2 Class 3 Console 4 Data Structure 5 Data Type 6 Deque 7 Development 8 File 9 Function 10 Generic 11 Language 12 List 13 Map Multimap 14 Overload 15 Pointer 16 Qt 17 Queue Stack 18 Set Multiset 19 STL Algorithms Binary search 20 STL Algorithms Heap 21 STL Algorithms Helper 22 STL Algorithms Iterator 23 STL Algorithms Merge 24 STL Algorithms Min Max 25 STL Algorithms Modifying sequence operations 26 STL Algorithms Non modifying sequence operations 27 STL Algorithms Sorting 28 STL Basics 29 String 30 Valarray 31 Vector
 C++ » Vector » vector find Screenshots
Find the last subsequence (which should be the same as the first)
 ```   #include  #include  #include  using namespace std; int main(int argc, char** argv) {   int elems[] = {5, 6, 9, 8, 8, 3};   vector myVector(elems, elems + 6);    vector::const_iterator it, it2;     int sub[] = {8, 3};      it2 = find_end(myVector.begin(), myVector.end(), sub, sub + 2);   if (it != it2) {     cout << "Error: search and find_end found different subsequences "    << " even though there is only one match.\n";   }   return (0); }           ```
Related examples in the same category
 1 Locate maximum element in a vector 2 Locate minimum element in a vector 3 Demonstrating the generic find algorithm with a vector 4 Find the min value in the vector 5 Find the max value in the vector 6 Find the first pair of matching consecutive elements 7 Find the first of two values 8 Find the first subsequence 9 Find the first subsequence of two consecutive 8s 10 Binary search a vector 11 Search the vector for the elements present in the list 12 Returns the positions of all values within a range