title: java List processing time
body: <p>This is from wikipedia: <a href="http://en.wikipedia.org/wiki/Arraylist" rel="nofollow">http://en.wikipedia.org/wiki/Arraylist</a> under <i>Performance</i>.</p>
  
  <p>ArrayList: constant time for remove(), add() at end of array, linear time to add(), remove() at beginning.</p>
  
  <p>LinkedList: both of operations stated : constant time, indexing: linear.</p>
  
  <hr>
  
  <p>1)Why the difference in arraylist processing time between the two operations? </p>
  
  <p>2)Linkedlist is linear for indexing, constant for adding at the end, why?</p>