Sure we can go over both cases:
Case 1: Growth factor of 2 and an initial size of 10 bytes.
Start with an initial allocation of 10 bytes of memory.
On growth allocate 20 bytes and release the 10 bytes, leaving a hole 10 bytes.
On growth allocate 40 bytes and release the 20 bytes, the hole in memory is now 30 bytes large (the initial 10 byte hole + the new 20 byte hole).
On growth allocate 80 bytes and release the 40 bytes, the hole is now 60 bytes.
On growth allocate 160 bytes and release the 80 bytes, the hole is now 140 bytes.
So on so forth... using this strategy it is never possible for the dynamic array to reclaim the hole it left behind in memory.
Case 2: Growth factor of 1.5 and an initial size of 10 bytes.
Start with an initial allocation of 10 bytes of memory.
On growth allocate 15 bytes and release the 10 bytes, leaving a hole 10 bytes.
On growth allocate 22 bytes and release the 15 bytes, the hole in memory is now 25 bytes large (the initial 10 byte hole + the new 15 byte hole).
On growth allocate 33 bytes and release the 22 bytes, the hole is now 47 bytes.
On growth allocate 50 bytes and release the 33 bytes, the
hole is now 80 bytes.
On growth reuse 75 bytes from the hole in memory left over from previous growths, the hole is now 5 bytes.
With a growth factor of 1.5 (or anything less than the golden ratio), the hole grows up to a point and then shrinks, grows and shrinks, allowing the dynamic array to reuse memory from past allocations.
With a growth factor of 2, the hole in memory continues to grow and grow and grow.