Understanding How Python Stores Lists in Memory | Intro to CS

Storing Lists in Memory

• 💡 When a list is defined, the computer allocates space in short-term memory and tags it with the variable name.
• 🧠 Unlike primitive data types, lists can hold values of any type and their length can change, so Python doesn't allocate a single large chunk of memory for all elements.
• 🧩 Instead, individual elements are stored in scattered memory locations, and a separate small chunk of memory acts as a directory, pointing to these locations.
• 📌 The variable name points to this directory, specifically to the first slot which holds the location of the element at index zero.

Accessing and Modifying List Elements

• 🔍 To access an element, the computer finds the variable, uses the index as an offset from the initial location, and follows the pointer to the actual element's value.
• 🔄 For self-referencing assignments, like wave[1] = wave[1] + 3, the computer accesses the current value, performs the operation, and then updates the list's directory to point to the new value's memory location.
• 🗑️ Memory for old values that are no longer referenced is eventually cleared by the computer.

List Length and Indexing

• 📊 The len() function returns the number of elements in a list, which is distinct from the indices, as indices start at zero.
• ⚠️ An index error occurs when attempting to access an element at an index that is outside the bounds of the list.

Optimizations and Memory Management

• ⚡ Python can optimize storage by having multiple variables point to the same memory location for a list element, rather than duplicating the value.
• ⚙️ The computer often pre-calculates and stores the length of a list to avoid recounting elements each time.
• 🧹 Upon program termination, all short-term memory is cleared.