Lists, Indices, and Strings

A list bundles many related values into a single named collection, so a program can work with hundreds of items using one name and a changing index instead of hundreds of separate variable names. This matters the moment you want to repeat an action over many values: a loop can walk through a list by index, touching every element with a few lines of code, something impossible if every value needed its own name.

An index is just the position of an item within the ordered sequence. In this pseudocode, indexing is 1 based: the first element lives at index 1, the second at index 2, and so on, up through index n for a list of n items. To read or change one value, a program names the list and gives an index, and that pair picks out exactly one element. Asking for an index that does not exist, like index 9 in a 5 item list, is an error, not a safe fallback. The list does not resize itself, return an empty value, or clamp to the last item. It simply fails, because that position names nothing.

Lists set up the next step in this unit: procedures that take a list as input and loop over its indices to search, sum, or sort its contents. Every one of those algorithms depends on knowing exactly where each element lives, which is the whole job of an index.