title: Big-O of Copying Elements in a Dynamic Array
body: <p>So I would like to ask about the asymptotic growth of copying elements in a dynamic array algorithm. </p>
  
  <p>In the dynamic array algorithm, the array is doubled in size every time that is it full and a new element is supposed to be added. When the array is full, it contains N/2 elements, and after it is doubled, the size of the new array is 2N. The next element is then inserted at after the copied objects/values.</p>
  
  <p>I believed that the Big-O for the number of elements copied would be O(N/2), but would I also have to account for the times that the array has been doubled? </p>
  
  <p>Just to be very clear, this is a problem that my instructor has assigned, and I have been thinking about it, but I'm currently unsure about if/how to account for the number of times the array has been doubled, given only a size N array.</p>