Which algorithm is used in List to dynamically allocate memory?

Question

Now I have an algorithm for dynamically allocating memory on an array:

• If array is full I create a new array of twice the size, and copy items.
• If arr

Answer 1

No need to reinvent the wheel.

From MSDN:

Capacity is the number of elements that the List<(Of <(T>)>) can store before resizing is required, while Count is the number of elements that are actually in the List<(Of <(T>)>).

Capacity is always greater than or equal to Count. If Count exceeds Capacity while adding elements, the capacity is increased by automatically reallocating the internal array before copying the old elements and adding the new elements.

The capacity can be decreased by calling the TrimExcess method or by setting the Capacity property explicitly. When the value of Capacity is set explicitly, the internal array is also reallocated to accommodate the specified capacity, and all the elements are copied.

Retrieving the value of this property is an O(1) operation; setting the property is an O(n) operation, where n is the new capacity.