In implementing dynamic arrays, if we expand the array by a fix number of cells when the array is full, then the asymptotically tight best time for inserting elements into the dynamic arrays will be per item.

$O(n)$

$O(1)$

$O(logn)$

$o(n^2)$