Purpose of magic methods in Python - Time & Space Complexity

Time Complexity: Purpose of magic methods

O(n)

Understanding Time Complexity

We want to understand how the use of magic methods affects the time it takes for a program to run.

Specifically, how does calling these special methods impact performance as input grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

class Counter:
    def __init__(self, start=0):
        self.value = start
    def __add__(self, other):
        return Counter(self.value + other)

c = Counter(5)
c2 = c + 10
print(c2.value)

This code defines a class with a magic method __add__ to add numbers using the + operator.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Calling the __add__ magic method when using + operator.
• How many times: Once per addition operation in this example.

How Execution Grows With Input

Each time you add, the __add__ method runs once, doing a simple addition.

Input Size (n)	Approx. Operations
10	10 additions, 10 calls to __add__
100	100 additions, 100 calls to __add__
1000	1000 additions, 1000 calls to __add__

Pattern observation: The number of operations grows directly with how many additions you do.

Final Time Complexity

Time Complexity: O(n)

This means the time grows in a straight line with the number of additions performed.

Common Mistake

[X] Wrong: "Magic methods make operations instant or free."

[OK] Correct: Magic methods are just functions that run code; they take time like any other call.

Interview Connect

Understanding how magic methods work and their cost helps you write clear and efficient code, a skill valued in real projects and interviews.

Self-Check

"What if the __add__ method called another method inside it? How would that affect the time complexity?"