Searches one container for a sequence in another container - C++ STL Algorithm

C++ examples for STL Algorithm:search

  1. HOME
  2. C++
  3. STL Algorithm
  4. search

Description

Searches one container for a sequence in another container

Demo Code

#include <iostream>
#include <algorithm>
using namespace std;
int source[] =  { 11, 44, 33, 11, 22, 33, 11, 22, 44 };
int pattern[] = { 11, 22, 33 };
int main()/*w  w w.j ava2s  .  co m*/
{
   int* ptr;
   ptr = search(source, source+9, pattern, pattern+3);
   if(ptr == source+9)                // if past-the-end
      cout << "No match found\n";
   else
      cout << "Match at " << (ptr - source) << endl;
   return 0;
}

Result


Related Tutorials