title: Determine if a sequence contains all elements of another sequence using Linq
body: <p>Given two sets of values:</p>
  
  <pre><code>var subset = new[] { 2, 4, 6, 8 };
  
  var superset = new[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
  </code></pre>
  
  <p>how do I determine if <code>superset</code> contains all elements of <code>subset</code>?</p>
  
  <p>I have come up with this:</p>
  
  <pre><code>superset.Intersect(subset).Count() == subset.Count()
  </code></pre>
  
  <p>Is this the most logical and efficient method?</p>