title: List Intersection
body: <p>I want to compute a list "intersection". The problem is:</p>
  
  <pre><code>L1 = [1, 0, 2, 3, 1 , 3, 0, 5]
  L2 = [3, 5]
  </code></pre>
  
  <p>Then the result will be</p>
  
  <pre><code>L3 = [0, 0, 0, 1, 0, 1, 0, 1]
  </code></pre>
  
  <p>Then i will convert this result in a byte.  In this case will be 21 in decimal format.</p>
  
  <p>I want to make in delphi and I need this do efficiently.  Is there a way to solve this problem better than O(m*n)?</p>