Arithmetic operators in Java - Time & Space Complexity

Time Complexity: Arithmetic operators

O(1)

Understanding Time Complexity

We want to see how the time to do arithmetic operations changes as we use bigger numbers or more operations.

How does the program's speed change when it does addition, subtraction, multiplication, or division?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

int a = 5;
int b = 10;
int sum = a + b;
int diff = b - a;
int product = a * b;
int quotient = b / a;
System.out.println(sum + ", " + diff + ", " + product + ", " + quotient);
    

This code performs basic arithmetic operations on two numbers and prints the results.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Four arithmetic operations (addition, subtraction, multiplication, division).
• How many times: Each operation runs exactly once.

How Execution Grows With Input

Explain the growth pattern intuitively.

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

Pattern observation: The number of operations stays the same no matter how big the numbers are.

Final Time Complexity

Time Complexity: O(1)

This means the time to do these arithmetic operations does not grow with input size; it stays constant.

Common Mistake

[X] Wrong: "Doing arithmetic on bigger numbers takes more time because the numbers are larger."

[OK] Correct: For basic integer operations in Java, the time is constant because the processor handles fixed-size numbers quickly regardless of their value.

Interview Connect

Understanding that simple arithmetic operations run in constant time helps you focus on the parts of code that really affect performance.

Self-Check

"What if we changed the code to perform arithmetic inside a loop that runs n times? How would the time complexity change?"