push_back is "O(1)". But sometimes it is O(n), because the array is full and has to be copied into a bigger one. So which is it?
Take a dynamic array that doubles when full. Start at capacity 1 and push n items. The copies happen at sizes 1, 2, 4, 8, ... up to n, copying that many items each time:
1 + 2 + 4 + ... + n/2 < n
Total copy work is below n, plus n writes for the pushes themselves: under 2n operations for n pushes. So the amortized cost per push is O(1): expensive steps are rare enough that the average stays constant.
Why double and not "add 10"? With a fixed increment k, copies happen every k pushes and cost grows linearly each time, total about n²/(2k). Quadratic. The geometric growth is what makes it work, and any factor above 1 does the job. Many implementations use 1.5 to leave room to reuse freed memory.
Puzzle: what is the worst-case cost of a single push, and when does it happen? (Answer: O(n), right after the array fills, and that is the "hiccup" some latency-sensitive code cannot afford.)