does the ability of resizing a Vector to a longer length implies that Vector is internally represented as something like a linked list, rather than a contiguous piece of memory???
No, it’s contiguous memory. If you resize a vector grows the allocated memory block, reserving and exponentially growing block of memory so that append is amortized constant time.
resize!() actually calls growend!(), which in turn calls a C routine (that I could not inspect further).
so, the behavior of growend!() would be something like: if there’s available memory after the end, use it; or if there’s none, copy to a new piece of contiguous memory.