Methods that operate on state in C Sharp (C#) - Time & Space Complexity

Time Complexity: Methods that operate on state

O(1)

Understanding Time Complexity

When methods change or use stored information, it affects how long the program takes to run.

We want to know how the time grows when these methods work on bigger or more data.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

public class Counter
{
    private int count = 0;

    public void Increment()
    {
        count++;
    }

    public int GetCount()
    {
        return count;
    }
}

This code defines a class with a number that can be increased and read.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Single increment or return of a stored number.
• How many times: Each method runs once per call, no loops inside.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
10	10 increments or reads
100	100 increments or reads
1000	1000 increments or reads

Pattern observation: Each call does a fixed small task, so time grows directly with how many times you call the method.

Final Time Complexity

Time Complexity: O(1)

This means each method call takes the same small amount of time, no matter how big the data or how many times it was called before.

Common Mistake

[X] Wrong: "Incrementing a stored number takes longer as the number gets bigger."

[OK] Correct: The method just adds one to a number, which is a simple step and does not get slower with bigger numbers.

Interview Connect

Understanding how simple methods that change or read stored data work helps you explain and write efficient code in real projects.

Self-Check

"What if the Increment method added a loop that counted up to the current number? How would the time complexity change?"