About this question
Medium · Algorithms & Data Structures · Quant Trader interview question · dynamic-array, amortized-analysis, algorithms, data-structures
A dynamic array starts with a size of 1. When the array is full, it doubles in size. Appending an element takes $O(1)$ time, except when the array is full, in which case doubling the array takes $O(n)$ time, where $n$ is the current size of the array. What is the amortized time complexity of $n$ append operations?