What is Python - Complexity Analysis

Time Complexity: What is Python

O(n)

Understanding Time Complexity

When we talk about Python, we often wonder how fast it runs tasks as the work grows.

We want to know how the time Python takes changes when we give it more work.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def greet(names):
    for name in names:
        print(f"Hello, {name}!")

people = ["Alice", "Bob", "Charlie"]
greet(people)

This code says hello to each person in a list by printing a greeting.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each name in the list.
• How many times: Once for every person in the list.

How Execution Grows With Input

As the list of names grows, the number of greetings grows the same way.

Input Size (n)	Approx. Operations
10	10 greetings
100	100 greetings
1000	1000 greetings

Pattern observation: The work grows directly with the number of names.

Final Time Complexity

Time Complexity: O(n)

This means if you double the number of names, the time to say hello also doubles.

Common Mistake

[X] Wrong: "The time to greet everyone stays the same no matter how many people there are."

[OK] Correct: Because the code says hello to each person one by one, more people means more greetings and more time.

Interview Connect

Understanding how Python handles tasks as they grow helps you explain your code clearly and shows you think about efficiency.

Self-Check

"What if we changed the list to a dictionary of names and ages? How would the time complexity change?"