ArrayList::add Time Complexity disagreement

For context, each time I refer to "ArrayList," I am referring to

Java.util.ArrayList

Java.util.ArrayList

.

I heard someone say that

ArrayList::add

ArrayList::add

had a time complexity of O(1) (constant time), but when I looked, it calls

ArrayList::grow

ArrayList::grow

, which calls

System::arrayCopy

System::arrayCopy

, which iterates over the length of the original array to copy the values (or pointers, in Java) of each element. I suspect this would make

ArrayList::add

ArrayList::add

have a time complexity proportional to the original length of the array (so, O(n)); am I incorrect?

77 replies