Data Structures: Organizing Information

In the previous chapter we learned how functions organize logic.

This chapter focuses on organizing data.

If variables are single labeled boxes, data structures are ways to manage many values together.

---

Why Data Structures Matter

As programs grow, raw variables are not enough.

You often need to store collections of related values and access them efficiently.

Data structures define how that information is arranged and used.

Different structures support different operations well.

---

Lists / Arrays

A list (or array) stores an ordered sequence of items.

Good for:

• keeping items in order
• iterating through all elements
• indexing by position

Example use cases: playlist entries, search results, transaction history.

---

Maps / Dictionaries

A map (dictionary) stores key-value pairs.

Good for:

• quick lookup by key
• representing structured records
• counting frequencies

Example use cases: user profile by field name, product by ID, word frequency tables.

---

Stacks

A stack follows Last In, First Out (LIFO).

The most recently added item is removed first.

Common examples:

• undo history
• function call stack
• expression evaluation

---

Queues

A queue follows First In, First Out (FIFO).

The earliest added item is removed first.

Common examples:

• print job processing
• task scheduling
• request buffering

---

Visual Comparison

graph LR
  A[List: Ordered Values]
  B[Map: Key -> Value]
  C[Stack: LIFO]
  D[Queue: FIFO]

You do not need deep theory yet. The key is to understand that structure choice changes how easy certain operations are.

---

Choosing the Right Structure

Ask practical questions:

• Do I need ordered iteration? Use list.
• Do I need fast lookup by key? Use map.
• Do I need reverse-order processing? Use stack.
• Do I need first-come-first-served behavior? Use queue.

This “fit the structure to the problem” mindset is fundamental in software engineering.

---

Key Ideas to Remember

• Data structures organize collections of values.
• Lists handle ordered sequences.
• Maps support key-based lookup.
• Stacks and queues model different processing orders.
• Choosing the right structure improves clarity and efficiency.

---

What Comes Next

By now we can write non-trivial logic.

But programs rarely work perfectly on the first try.

Next we cover a real part of programming life:

debugging, testing, and fixing bugs.