List : sequence, dup elements.
methods: get(i), contains, indexOf
ArrayList : capocity of array, fast random access
size, isEmpty, get, set, iterator, listIterator - constant time
add - amortized constant time, O(n) time
other - linear time
lower constant factor than LinkedList
LinkedList :stack, queue, deque, slow random access, fast insert and delete, memory pointer
- ArrayList vs LinkedList
http://narencoolgeek.blogspot.com/2006/09/arraylist-vs-linkedlist.html
ArrayList : capocity of array, fast random access
size, isEmpty, get, set, iterator, listIterator - constant time
add - amortized constant time, O(n) time
other - linear time
lower constant factor than LinkedList
LinkedList :stack, queue, deque, slow random access, fast insert and delete, memory pointer
- ArrayList vs LinkedList
http://narencoolgeek.blogspot.com/2006/09/arraylist-vs-linkedlist.html
- Selecting Your Collections Library
