What will be the execution time of adding an element to the end of an array if its complexity exceeds O(1)?

If the operation of adding an element to the end of an array has a complexity greater than O(1), it means that the execution time depends on the size of the array and can be, for example, O(n).

In standard dynamic arrays (for example, Swift Array), adding to the end is usually amortized O(1): when the internal buffer is full, a memory reallocation and copying of elements occurs, which takes O(n), but happens rarely.

If the complexity exceeds O(1) constantly, it may indicate that:

• The array is implemented inefficiently and every addition involves copying all elements.
• A data structure is used where adding to the end requires traversal or restructuring.

Thus, the execution time will be linear or worse, which negatively affects performance with large data volumes.