title: What qualifies as a (slow) access to an internal element of a LinkedList
body: <p>A post on LinkedList says:</p>
  
  <p>LinkedList allows for constant-time insertions or removals, but only sequential access of elements. In other words, <code>you can walk the list forwards or backwards, but grabbing an element in the middle</code> takes time proportional to the size of the list.</p>
  
  <p>I'm not understanding what will qualify for grabbing the element in the middle?</p>
  
  <p>In below piece of code, assuming <code>arrL</code> is a LinkedList that holds 50 elemnets, when counter <code>j</code> reaches 20, and program executes <code>arrL.get(20)</code>.. Does that mean program is grabbing the element in middle? Also in below program I'm just walking the list forward, isn't?</p>
  
  <pre><code>    for(int j=0;j&lt;arrL.size();++j){
          arrL.get(j);
      }
  </code></pre>