REPLACE function in MySQL - Time & Space Complexity

Time Complexity: REPLACE function

O(n)

Understanding Time Complexity

We want to understand how the time it takes to run the REPLACE function changes as the size of the text grows.

How does the work grow when the input string gets longer?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

SELECT REPLACE(description, 'old', 'new') AS updated_description
FROM products;
    

This code replaces every occurrence of the word 'old' with 'new' in the description column of the products table.

Identify Repeating Operations

• Primary operation: Scanning each character in the description string to find matches.
• How many times: Once for each character in the string.

How Execution Grows With Input

As the length of the description grows, the time to check and replace grows roughly in the same way.

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

Pattern observation: The work grows directly with the length of the string.

Final Time Complexity

Time Complexity: O(n)

This means the time to run REPLACE grows in a straight line as the string gets longer.

Common Mistake

[X] Wrong: "REPLACE runs instantly no matter how long the string is."

[OK] Correct: The function must look at each character to find matches, so longer strings take more time.

Interview Connect

Understanding how string functions like REPLACE scale helps you explain performance in real projects and shows you think about efficiency clearly.

Self-Check

"What if we replaced multiple different words in one REPLACE call? How would the time complexity change?"