How to do an array search?

Question

C++ / C#

Hello!
I’m stupid, but I can’t figure out whether it is possible to solve the following problem without explicit cycles:
There is an array of roots for male names / patronymics: Gennad, Il, Vladislav, Grigor, etc.
How to check if the word "Gennady" has a match from this array?

Answer 1

string test = "Геннадий";
bool result = Roots.Any(x=> test.Contains(x));

Answer 2

No cycles? Even without the implicit ones (Contains contains a loop)? IMHO no.

Answer 3

Without cycles - it means library means?
stackoverflow.com/a/10366607
Algorithms: Aho-Korasik, KMP.

Answer 4

I think the cycle means the passage through all the elements.
And if you split the data so that you don’t have to do this (tree), then the answer is yes.
Like - the first letter 'G' - yes / no, this already removes 32 letters and everything below them, i.e. no longer a cycle.
And Many .