Why dictionary comprehension is used in Python - Performance Analysis

Time Complexity: Why dictionary comprehension is used

O(n)

Understanding Time Complexity

We want to understand how using dictionary comprehension affects the time it takes to create dictionaries.

How does the time grow when we make dictionaries this way?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

numbers = [1, 2, 3, 4, 5]
squares = {x: x * x for x in numbers}

This code creates a dictionary where each number is a key and its square is the value.

Identify Repeating Operations

• Primary operation: Looping through each item in the list once.
• How many times: Exactly once for each item in the input list.

How Execution Grows With Input

As the list gets bigger, the time to create the dictionary grows in a simple way.

Input Size (n)	Approx. Operations
10	About 10 operations
100	About 100 operations
1000	About 1000 operations

Pattern observation: The time grows directly with the number of items; double the items, double the time.

Final Time Complexity

Time Complexity: O(n)

This means the time to build the dictionary grows in a straight line with the number of items.

Common Mistake

[X] Wrong: "Dictionary comprehension is slower because it looks complicated."

[OK] Correct: Actually, dictionary comprehension runs in a simple loop just like other loops, so its time grows linearly and is efficient.

Interview Connect

Knowing how dictionary comprehension works and its time cost shows you understand how to write clean and efficient code, a skill that helps in many coding challenges.

Self-Check

"What if we used nested loops inside the dictionary comprehension? How would the time complexity change?"