title: Why get(index) slow more than remove(index) of LinkedList in Java
body: <p>I have a LinkedList with 100000 items of String.When i do an operation with index such as get,remove,add, it seems same mechanism. 
  First it browse the list to access Node[index], then does a another manipulation,
  with "get" it only references to item of Node, whereas even the "remove" does more.
  But why is the "get" operation take alot more time than the "remove" operation</p>
  
  <pre><code>for(int index=99999;index&gt;=0;index--){
      links.get(index);
  }
  </code></pre>
  
  <p>get time in nanoseconds: 15083052805</p>
  
  <pre><code>for(int index=99999;index&gt;=0;index--){
      links.remove(index);
  }
  </code></pre>
  
  <p>del time in nanoseconds: 2310625</p>
  
  <p>LinkedList's functions:</p>
  
  <pre><code>public E get(int index) {
      checkElementIndex(index);
      return node(index).item;
  }
  
  public E remove(int index) {
      checkElementIndex(index);
      return unlink(node(index));
  }
  </code></pre>