Does the size of the current array affect the time to insert a new element into an ArrayList?

Inserting a new element into an ArrayList usually occurs in amortized O(1) time, meaning it is independent of the current size of the array. However, if the internal array is full, it is expanded (increasing its size and copying elements), which takes O(n) time, where n is the current size of the array.

Thus, the size of the current array affects the insertion time only during expansion. In normal cases, insertion is fast, but when the array reaches capacity, the operation can be costly due to copying.