Dictionaries

Introduction to Dictionaries

Welcome! In this section, we are going to explore one of the most powerful and flexible ways to store data: the Dictionary. While you might already be familiar with Lists and Arrays, Dictionaries work a little differently. Instead of finding items by their position (like 0, 1, 2...), we find them using a unique Key.

Think of it like a real-life dictionary: you don't look for the 500th word in the book; you look for the specific word (the Key) to find its definition (the Value). This makes searching for specific information incredibly fast and organized!

What you will learn:
1. What a dictionary is and how it uses Key-Value pairs.
2. Why we use dictionaries instead of lists in certain situations.
3. The basic rules for creating keys and values.

3.2.5 What is a Dictionary?

A Dictionary (sometimes called an Associative Array) is a dynamic data structure that stores data in Key-Value pairs. Unlike a list, where items are ordered by a number (index), a dictionary connects a unique identifier to a piece of information.

The Key-Value Pair

Every entry in a dictionary consists of two parts:
1. The Key: This acts as the "address" or "name" for the data. It must be unique (you can't have two identical keys).
2. The Value: This is the actual data you want to store. Values do not have to be unique.

Real-World Analogy: The School Locker
Imagine a hallway of lockers.
- The Locker Number is the Key. It is unique; no two lockers have the same number.
- The Items Inside (books, bag, coat) are the Value. Different lockers might contain the same types of books, but you use the specific locker number to find your books.

Did you know? Your smartphone’s contact list is basically a dictionary! The "Name" is the Key, and the "Phone Number" is the Value. When you want to call someone, you search for the name, not the position they hold in the list.

Quick Review:
- Keys = Unique identifiers used for searching.
- Values = The data associated with the key.

How Dictionaries Work

Don't worry if this seems a bit abstract at first! The main thing to remember is that dictionaries are built for speed. In a list, if you want to find an item, the computer might have to look through every single item from the start (this is called a Linear Search). In a dictionary, the computer uses the key to jump straight to the data.

Important Rules for Dictionaries:

1. Keys must be unique: If you try to add a second entry with a key that already exists, the old data will usually be overwritten.
2. Keys are immutable: This is a fancy way of saying a key's name cannot be changed once it is created. You would have to delete it and make a new one.
3. Unordered: In many programming languages, dictionaries don't keep items in a specific "first to last" order. They are organized in a way that makes finding keys efficient.

Example Table of a Dictionary:
Imagine storing student grades.

Key (Student ID) | Value (Grade)
"S101" | "A"
"S102" | "B"
"S103" | "A"

Notice that two different students can have the same grade (the Value), but every student must have a different ID (the Key).

Key Takeaway: Use a dictionary when you have a specific label (like an ID number or a username) that you want to use to find data quickly.

Dictionary Operations

To use a dictionary effectively in your programs, you need to know how to perform four basic tasks. Think of the acronym CRUD: Create, Read, Update, Delete.

1. Adding/Creating (C)

You provide a new key and assign a value to it.
Example: Adding a new user "TechWizard" with the score 500 to a game dictionary.

2. Accessing/Reading (R)

Instead of using a number like myList[0], you use the key.
Example: Finding the score for "TechWizard" would look like scoreDict["TechWizard"].

3. Updating (U)

If you assign a new value to an existing key, the dictionary replaces the old value.
Example: Changing "TechWizard"'s score from 500 to 600.

4. Deleting (D)

You can remove a key and its associated value entirely.
Example: Removing a user who has deleted their account.

Common Mistake to Avoid: Trying to find a value by searching for it directly. Remember, dictionaries are one-way streets! You use the Key to find the Value. It is very slow and difficult to try and find a Key by using a Value.

Dictionaries vs. Lists: Which one should I use?

Choosing the right data structure is a key skill for any Computer Science student. Here is a simple guide to help you decide:

Use a List when:

- The order of the items matters (like a leaderboard or a "to-do" list).
- You want to access items by their position (e.g., "Give me the first item").
- You have a simple collection of similar items with no special labels.

Use a Dictionary when:

- You have unique labels (Keys) for your data.
- You need to find data quickly without searching through the whole structure.
- The data represents a Record of information (like a user profile with "Name", "Age", and "Email").

Memory Aid:
- List = Location (0, 1, 2...)
- Dictionary = Description (Key name)

Key Takeaway: Dictionaries are more efficient for looking up specific data, while lists are better for keeping things in a specific sequence.

Summary Checklist

Before you move on, make sure you feel confident with these points:
- [ ] I can define a Key-Value pair.
- [ ] I understand that Keys must be unique.
- [ ] I know that dictionaries are unordered and dynamic (they can grow and shrink).
- [ ] I can explain why a dictionary is faster than a list for searching for a specific record.

Don't worry if the logic of how the computer finds the keys feels "magical" for now—at this level, the most important thing is knowing HOW to use them to solve problems!