Most efficient way to access a sorted list in python
<p>As far as I understand it, a python list</p>

<pre><code>a = [0,1,2]
</code></pre>

<p>is similar to a stack.</p>

<p>So does this mean, that for a list b</p>

<pre><code> b[1]*b[2]
</code></pre>

<p>will be slower than</p>

<pre><code>b[10001] * b[10002]
</code></pre>

<p>because it takes longer to get the elements at the bottom of the stack? Or is there more to a python list than a simple stack?</p>