previous
|
start
|
next
Efficiency of Array List
Adding or moving an element
On average
n
/2 elements need to be moved
In big-Oh notations: O(n)
Random access
In big-Oh notation: O(1)
previous
|
start
|
next