replace() for value substitution in Data Analysis Python - Time & Space Complexity

Time Complexity: replace() for value substitution

O(n)

Understanding Time Complexity

We want to understand how the time taken by the replace() function changes as the data grows.

Specifically, how does replacing values in a data column scale with the number of rows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import pandas as pd

data = pd.DataFrame({
    'color': ['red', 'blue', 'green', 'red', 'blue'] * 1000
})

# Replace 'red' with 'crimson'
data['color'] = data['color'].replace('red', 'crimson')

This code replaces all occurrences of 'red' with 'crimson' in the 'color' column of a DataFrame.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking each element in the 'color' column to see if it matches 'red'.
• How many times: Once for each row in the DataFrame.

How Execution Grows With Input

As the number of rows increases, the function checks more elements one by one.

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

Pattern observation: The number of operations grows directly with the number of rows.

Final Time Complexity

Time Complexity: O(n)

This means the time to replace values grows linearly with the number of rows in the data.

Common Mistake

[X] Wrong: "replace() runs instantly no matter how big the data is."

[OK] Correct: The function must check each row to find matches, so more rows mean more work and more time.

Interview Connect

Understanding how simple data operations scale helps you write efficient data processing code and explain your choices clearly in interviews.

Self-Check

"What if we replaced multiple values at once using a dictionary in replace()? How would the time complexity change?"