A dynamic array that grows by a fixed 100 slots

Suppose a dynamic array instead grows by a fixed constant C each time it's full (capacity += C, e.g. C = 100), rather than doubling (capacity *= 2). For n push_back calls starting from empty, what is the total number of element copies across all reallocations, and what does that imply about the amortized cost per push_back?

26 of 46 in Data Structures & Algorithms