Arithmetic operators in MATLAB - Time & Space Complexity

Time Complexity: Arithmetic operators

O(n)

Understanding Time Complexity

Let's see how the time needed to do arithmetic operations changes as we work with more numbers.

We want to know how the time grows when we add, subtract, multiply, or divide many numbers.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

n = 1000;
result = 0;
for i = 1:n
    result = result + i;
end

This code adds up all numbers from 1 to n using a loop.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Addition inside the loop.
• How many times: The addition happens once for each number from 1 to n, so n times.

How Execution Grows With Input

As n grows, the number of additions grows the same way.

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

Pattern observation: The operations increase directly with n, so doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to finish grows in a straight line with the number of numbers we add.

Common Mistake

[X] Wrong: "Arithmetic operations like addition take the same time no matter how many times they run, so the loop time is constant."

[OK] Correct: Each addition takes a small fixed time, but doing it many times adds up, so the total time grows with the number of additions.

Interview Connect

Understanding how simple arithmetic inside loops affects time helps you explain how programs scale and shows you can think about efficiency clearly.

Self-Check

"What if we replaced the addition inside the loop with a multiplication? How would the time complexity change?"