I have the equation for growing an arraylist is the summation from 0 to lg(n) of 2^i. n is the number of elements. i is the number of times it has grown. Could someone explain why it only goes to lg(n)

Question

I have the equation for growing an arraylist is the summation from 0 to lg(n) of 2^i.  n is the number of elements. i is the number of times it has grown.  Could someone explain why it only goes to lg(n)

anonymous · Answer

I don't know.  I would need more implementation specifics to understand why.  What is the analysis for inserting into an arraylist?  What is the analysis for an arraylist which needs to grow?