Immediate execution methods in C Sharp (C#) - Time & Space Complexity

Time Complexity: Immediate execution methods

O(n)

Understanding Time Complexity

We want to understand how fast immediate execution methods run as the input grows.

How does the work change when we use methods that run right away?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

var numbers = Enumerable.Range(1, 5);

int count = numbers.Count();
int max = numbers.Max();
int sum = numbers.Sum();
    

This code uses immediate execution methods to get count, max, and sum from a list.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Each method (Count, Max, Sum) loops through the list once.
• How many times: Each method runs separately, so the list is traversed three times.

How Execution Grows With Input

Each method looks at every item once, so the work grows as the list gets bigger.

Input Size (n)	Approx. Operations
10	About 30 (3 times 10)
100	About 300 (3 times 100)
1000	About 3000 (3 times 1000)

Pattern observation: The total work grows linearly with input size, multiplied by the number of methods called.

Final Time Complexity

Time Complexity: O(n)

This means the time to finish grows directly with the number of items in the list.

Common Mistake

[X] Wrong: "Calling multiple immediate methods only loops through the list once."

[OK] Correct: Each immediate method runs separately and loops through the entire list, so multiple calls mean multiple passes.

Interview Connect

Knowing how immediate methods work helps you explain performance clearly and choose the best approach in real projects.

Self-Check

"What if we combined these operations into one loop? How would the time complexity change?"