What will be the fastest way to access an element from a collection?
<p>What will be the fastest way to access an element from a collection?</p>

<p>I am thinking should be in the order (low to high):</p>

<p>Indexing an Array &lt;= indexing a collection/list &lt;= use key on Dictionary</p>

<p>But I am not sure...  </p>

<p>1) Is indexing an array has same speed as indexing a list?</p>

<p>2) And will the indexing speed will grows as the size of the array/list grows?</p>

<p>From my understanding... indexing array should kind of using a pointer to point to the index of the element, which is caculated by the element size. So it should has same speed as indexing collection/list?</p>

<p>From what I know if we use Dictionary to look for a value, the speed of getting a value will grows as the size of Dictionary grows.</p>

<p>3) I just wonder what will be the fastest way to access an element from a collection?</p>

<p>Have been wondering for long time is my assumption is correct :)</p>

<p>Thanks</p>
