1) When adding the 2^n'th element. Linked List would just append to the tail O(1) time where as ArrayList would double the size copy half the array and then add it doing O(N) amount of work. Still though amortized…
1) When adding the 2^n'th element. Linked List would just append to the tail O(1) time where as ArrayList would double the size copy half the array and then add it doing O(N) amount of work. Still though amortized…