I want to know if at least one element in a first list can be found in a second list.
I can see two ways to do it. Let\'s say our lists are:
List<
The second one has better performance on large lists than the first one. Intersect puts the elements of one list into a hash table before checking the other list's elements for membership.
Intersect