Insert with arrays in MongoDB - Time & Space Complexity

Time Complexity: Insert with arrays

O(n)

Understanding Time Complexity

When inserting multiple items into a MongoDB document's array, it's important to understand how the time taken grows as the number of items increases.

We want to know how the cost changes when adding more elements to an array field.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

    db.collection.updateOne(
      { _id: 1 },
      { $push: { items: { $each: [1, 2, 3, 4, 5] } } }
    )
    

This code adds multiple values to the "items" array inside a document with _id 1.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding each element from the input array to the document's array.
• How many times: Once for each element in the input array (here 5 times).

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	10 insert steps
100	100 insert steps
1000	1000 insert steps

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

Final Time Complexity

Time Complexity: O(n)

This means the time to insert grows linearly with the number of elements you add to the array.

Common Mistake

[X] Wrong: "Adding multiple items at once is always constant time because it's one command."

[OK] Correct: Even though it's one command, MongoDB processes each element to add, so time grows with the number of elements.

Interview Connect

Understanding how batch inserts affect performance helps you design efficient database operations and shows you can think about scaling data changes.

Self-Check

"What if we used $addToSet instead of $push with $each? How would the time complexity change?"