For an array list of size $n,$ a single $($non$-$indexed, default position$)$ insertion can take, in the worst case, time

On average, non$-$indexed insertions take

When looking at this, we use