Complex numbers in MATLAB - Time & Space Complexity

Time Complexity: Complex numbers

O(n)

Understanding Time Complexity

We want to understand how the time to work with complex numbers changes as we handle more of them.

How does the program's work grow when we do operations on many complex numbers?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

n = 1000;
result = zeros(1,n);
for k = 1:n
    z = complex(k, k+1);
    result(k) = abs(z) + angle(z);
end

This code creates n complex numbers and calculates their magnitude and angle, storing the sum in an array.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The for-loop runs n times, creating and processing one complex number each time.
• How many times: Exactly n times, once for each element from 1 to n.

How Execution Grows With Input

Each new complex number adds a fixed amount of work, so the total work grows steadily as n grows.

Input Size (n)	Approx. Operations
10	About 10 times the work for one complex number
100	About 100 times the work for one complex number
1000	About 1000 times the work for one complex number

Pattern observation: The work grows directly in proportion to n; doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time needed grows in a straight line as the number of complex numbers increases.

Common Mistake

[X] Wrong: "Calculating magnitude and angle for many complex numbers takes the same time as for one number."

[OK] Correct: Each complex number requires separate calculations, so more numbers mean more total work.

Interview Connect

Understanding how time grows with input size helps you explain your code's efficiency clearly and confidently.

Self-Check

"What if we replaced the for-loop with a vectorized operation that processes all complex numbers at once? How would the time complexity change?"