S
Scott Handojo
Lets say I have the following arrays
X1 (1, 2, 7, 8)
X2 (1, 2, 4, 6)
X3 (1, 2, 3, 5)
X4 (1, 3, 5)
X5 (2, 3, 5)
X6 (4, 5, 6, 8)
My 'search array' is comprised of
S1 (1,2,3,5,7,8)
I want all the arrays with either the same values or a
subset there of. So the result should be that I have the
arrays
X1, X3, X4, X5
X2 is discarded because of the '4' and X6 because of
the '4'
I could go through each array, but that seems slow and
time consuming. Is there a faster way of doing this
within C#?
Thanks,
Scott
X1 (1, 2, 7, 8)
X2 (1, 2, 4, 6)
X3 (1, 2, 3, 5)
X4 (1, 3, 5)
X5 (2, 3, 5)
X6 (4, 5, 6, 8)
My 'search array' is comprised of
S1 (1,2,3,5,7,8)
I want all the arrays with either the same values or a
subset there of. So the result should be that I have the
arrays
X1, X3, X4, X5
X2 is discarded because of the '4' and X6 because of
the '4'
I could go through each array, but that seems slow and
time consuming. Is there a faster way of doing this
within C#?
Thanks,
Scott