Operator overloading concept in Swift - Time & Space Complexity

Time Complexity: Operator overloading concept

O(n)

Understanding Time Complexity

When we use operator overloading, we create custom ways to use operators like + or * with our own types.

We want to see how the time it takes to run changes as the input size grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

struct Vector {
  var values: [Double]

  static func + (left: Vector, right: Vector) -> Vector {
    var result = [Double]()
    for i in 0..

This code defines how to add two Vector objects by adding their elements one by one.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: A for-loop that adds each pair of elements from two arrays.
• How many times: The loop runs once for each element in the vectors, so as many times as the vector length.

How Execution Grows With Input

Explain the growth pattern intuitively.

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

Pattern observation: The number of operations grows directly with the size of the vectors. Double the size, double the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to add two vectors grows in a straight line with the number of elements.

Common Mistake

[X] Wrong: "Operator overloading makes the operation instant or constant time."

[OK] Correct: Even though the operator looks simple, it still does work for each element, so time grows with input size.

Interview Connect

Understanding how operator overloading affects performance helps you explain your code clearly and shows you think about efficiency.

Self-Check

"What if we changed the Vector to store a fixed number of elements instead of an array? How would the time complexity change?"