ArrayList ImplementationWhen an ArrayList object needs more space, it resizes itself by al...

ArrayList Implementation

When an ArrayList object needs more space, it resizes itself by allocating more memory and copying the current object to a larger block of memory.

How much more space does an ArrayList object allocate when it resizes itself? Consider the following three strategies.

a. Increase the capacity by 10.

b. Double the current capacity.

c. Increase the capacity by 1.

Assume that

   • an ArrayList is initialized with a capacity of 10 values,

   • new data come one value at a time, and

   • eventually the list will need to accommodate 80 values.

Calculate the total number of elements that are copied using each of the three strategies for resizing. Which strategy would use you use to implement ArrayList and why?