title: EDIT: Never mind
body: <p>EDIT: Wow I'm so sorry....I somehow confused the LinkedList and ArrayList columns in the second graph >_> I didn't sleep much ....sorry...At least one answer did help me in other ways, with a detailed explanation, so this post wasn't a TOTAL waste...</p>
  
  <p>I did find some topics about this but there were contradictions in posts, so I wanted confirmation on who was correct.</p>
  
  <p>This topic here is what I found:
  <a href="https://stackoverflow.com/questions/322715/when-to-use-linkedlist-over-arraylist">When to use LinkedList over ArrayList?</a></p>
  
  <p>The most upvoted answer says:<br></p>
  
  <blockquote>
    <p>"For LinkedList</p>
    
    <ul>
    <li>get is O(n)</li>
    <li>add is O(1)</li>
    <li>remove is O(n)</li>
    <li>Iterator.remove is O(1)</li>
    </ul>
    
    <p>For ArrayList</p>
    
    <ul>
    <li>get is O(1)</li>
    <li>add is O(1) amortized, but O(n) worst-case since the array must be resized and copied </li>
    <li>remove is O(n)"</li>
    </ul>
  </blockquote>
  
  <p>But then someone else posted a link here that says:<br>
  <a href="http://leepoint.net/notes-java/algorithms/big-oh/bigoh.html" rel="nofollow noreferrer">http://leepoint.net/notes-java/algorithms/big-oh/bigoh.html</a></p>
  
  <pre><code>Algorithm     ArrayList   LinkedList
  access front     O(1)         O(1)
  access back      O(1)         O(1)
  access middle    O(1)         O(N)
  insert at front  O(N)         O(1)
  insert at back   O(1)         O(1)
  insert in middle O(N)         O(1)
  </code></pre>