What is the most efficient way to check for occurrence of a sequence in an array?

Question

C++ / C#

Hello. I have a task - to find a sequence in an array. Let's say there is an array a={x,y,z,...} and an array b={x,y}. We need to check if array b is contained in a. What algorithm will be the most efficient here and what is its running time? The solution is desirable in C++\C#. Thanks in advance

Answer 1

the simplest is whip-moriss-pratt

Answer 2

If you need to check for a continuous sequence, then this is a search for a substring in the alphabet x, y, z, ...

Answer 3

The simplest, "interview-ready" and just right thing to do is to use the standard library.
en.cppreference.com/w/cpp/algorithm/includes
PS Anyway, read en. cppreference.com/w/cpp/algorithm, there is a lot of interesting stuff :)