List.BinarySearch vs Dictionary.TryGetValue - which is faster
<p>Which would be faster for say 500 elements.</p>

<p>Or what's the faster data structure/collection for retrieving elements?</p>

<pre><code>        List&lt;MyObj&gt; myObjs = new List&lt;MyObj&gt;();
        int i = myObjs.BinarySearch(myObjsToFind);
        MyObj obj = myObjs[i];
</code></pre>

<p>Or</p>

<pre><code>        Dictionary&lt;MyObj, MyObj&gt; myObjss = new Dictionary&lt;MyObj, MyObj&gt;();
        MyObj value;
        myObjss.TryGetValue(myObjsToFind, out value);
</code></pre>
