An array gives you a fixed block of memory: you decide how many slots you need, and that decision is locked in when the array is created. A list, by contrast, is designed to be dynamic — it grows and shrinks as elements are added and removed, so the programmer does not have to predict the final size in advance. This topic examines how that dynamic behavior is actually achieved, either by reallocating and copying a larger backing array behind the scenes, or by linking separately allocated nodes together so that each new element simply gets its own piece of memory.
These mechanics matter for the rest of the course because they explain where the cost of an operation comes from. Resizing an array is not free: a new, larger block must be allocated and every existing element copied into it. Linked structures avoid that copying but give up the constant-time indexed access that contiguous memory provides. Understanding both mechanisms is what lets you say, with evidence, why one structure is the better fit for a given use case.
As you watch, pay attention to three things: what happens in memory at the moment a structure runs out of room, how elements are shifted or re-linked when something is inserted or removed in the middle, and how you reach the element at a particular position. Keep a running list of the trade-offs you notice — fixed versus variable size, contiguous versus scattered memory, cheap indexing versus cheap insertion. Those notes will feed directly into the Big O discussion later in this module.
An animated walkthrough of how an array is resized in Java. Based on its title and format, it should show visually what happens when a fixed-size array fills up: allocating a new, larger array, copying the existing elements across, and redirecting the reference to the new block. This is the mechanism that sits underneath dynamic array-backed lists.
The animation makes the hidden cost of "growing" an array visible, which is exactly what the subtopics on variable sizing and memory allocation require; Dinesh Varyani's DSA series is a widely used, structured treatment of these fundamentals.
The implementation companion to the animation video, working through resizing an array in Java in actual code. Expect to see the allocation of a larger array, the copy loop or copy utility, and the bookkeeping needed to track capacity versus the number of elements stored.
Watching the code immediately after the animation connects the conceptual picture to concrete steps, reinforcing why dynamic resizing involves work proportional to the number of elements already stored.
A short C++ tutorial on linked lists, presented as a way to store a set of elements that can grow and shrink dynamically. It should introduce nodes, the pointers that connect them, and how the structure expands without needing one contiguous block of memory. The description explicitly frames linked lists as the dynamic alternative to fixed storage.
This video supplies the other half of the comparison — element management through linking rather than copying — and comes from LinkedIn Learning, a professional training producer, making it a clear contrast to the array-resizing videos.
Together these videos build the structural foundation the module's outcomes depend on. The two resizing videos show the memory layout and sizing behavior of arrays, while the linked list video shows how a dynamic structure manages elements without a fixed contiguous block, supporting MO1's array-versus-list comparison. Seeing copying, shifting, and pointer re-linking in action prepares you to describe access, search, insertion, and deletion and to notice that cost depends on position (MO2). Those observations are the raw material for naming operations as O(1) or O(n) once Big O notation is introduced (MO3), and for arguing which structure suits a given use case (MO4).
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.