$min and $max update operators in MongoDB - Time & Space Complexity

Time Complexity: $min and $max update operators

O(n)

Understanding Time Complexity

When using the $min and $max update operators in MongoDB, it's important to understand how the time to perform these updates changes as the data grows.

We want to know how the cost of updating documents scales when applying these operators.

Scenario Under Consideration

Analyze the time complexity of the following MongoDB update operation.

db.collection.updateMany(
  { },
  { $max: { score: 100 }, $min: { score: 50 } }
)
    

This code updates all documents in the collection, clamping the field score between 50 and 100 (sets to 100 if less than 100, and to 50 if greater than 50).

Identify Repeating Operations

Look at what repeats as the update runs:

• Primary operation: The update checks and possibly modifies the score field in each document.
• How many times: Once for every document matched by the query (here, all documents).

How Execution Grows With Input

As the number of documents grows, the update operation must check each one.

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

Pattern observation: The work grows directly with the number of documents to update.

Final Time Complexity

Time Complexity: O(n)

This means the time to complete the update grows linearly with the number of documents affected.

Common Mistake

[X] Wrong: "The $min and $max operators update only a few documents quickly regardless of collection size."

[OK] Correct: These operators check every matched document, so if many documents match, the update time grows with that number.

Interview Connect

Understanding how update operators like $min and $max scale helps you explain performance considerations clearly in real projects.

Self-Check

What if we added a filter to update only documents where score is greater than 100? How would the time complexity change?