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?"

Practice

1. Which of the following methods in C# causes immediate execution of a LINQ query?

easy

A. ToList()

B. Where()

C. Select()

D. OrderBy()

Solution

1. Step 1: Understand deferred vs immediate execution

   Methods like Where(), Select(), and OrderBy() only build the query and do not execute it immediately.

2. Step 2: Identify immediate execution methods

   ToList() forces the query to run and returns a list immediately.

3. Final Answer:

   ToList() -> Option A

4. Quick Check:

   Immediate execution = ToList() [OK]

Hint: Immediate methods like ToList() run queries right away [OK]

Common Mistakes:

• Confusing deferred methods like Where() as immediate
• Thinking Select() executes query immediately
• Assuming OrderBy() runs query instantly

2. Which of the following is the correct syntax to immediately get the count of elements in a LINQ query numbers?

easy

A. int count = numbers.Count;

B. int count = Count(numbers);

C. int count = numbers.Count();

D. int count = numbers.Count[];

Solution

1. Step 1: Recognize Count() as a method

   In LINQ, Count() is a method that must be called with parentheses to execute immediately.

2. Step 2: Check syntax correctness

   numbers.Count() is the correct syntax; Count without parentheses is a property, which does not exist here.

3. Final Answer:

   int count = numbers.Count(); -> Option C

4. Quick Check:

   Count() method needs parentheses [OK]

Hint: Count() always needs parentheses to execute immediately [OK]

Common Mistakes:

• Using Count without parentheses
• Trying to call Count as a standalone function
• Using invalid syntax like Count[]

3. What is the output of the following code?

var numbers = new List<int> {1, 2, 3, 4};
var result = numbers.Where(n => n > 2).Count();
Console.WriteLine(result);

medium

A. 0

B. 3

C. 4

D. 2

Solution

1. Step 1: Filter numbers greater than 2

   The Where method filters numbers: 3 and 4 satisfy the condition, so filtered list is [3,4].

2. Step 2: Count the filtered elements

   Count() returns the number of elements in the filtered list, which is 2.

3. Final Answer:

   2 -> Option D

4. Quick Check:

   Count of numbers > 2 = 2 [OK]

Hint: Count() after Where() counts filtered items immediately [OK]

Common Mistakes:

• Counting original list length instead of filtered
• Confusing Count() with deferred execution
• Assuming Where() returns count directly

4. Identify the error in this code snippet:

var list = new List<string> {"apple", "banana"};
var first = list.First;
Console.WriteLine(first);

medium

A. Missing parentheses after First method

B. List initialization syntax is wrong

C. Console.WriteLine cannot print strings

D. First method does not exist on List

Solution

1. Step 1: Check usage of First method

   First is a method and requires parentheses to execute immediately.

2. Step 2: Identify syntax error

   Code uses list.First without parentheses, which causes a compile-time error.

3. Final Answer:

   Missing parentheses after First method -> Option A

4. Quick Check:

   First() needs () to run immediately [OK]

Hint: Always add () when calling immediate execution methods [OK]

Common Mistakes:

• Forgetting parentheses on First()
• Thinking First is a property
• Misunderstanding List initialization syntax

5. Given a list of integers, how can you immediately get a list of only even numbers using LINQ and immediate execution methods?

hard

A. var evens = numbers.Where(n => n % 2 == 0);

B. var evens = numbers.Where(n => n % 2 == 0).ToList();

C. var evens = numbers.Select(n => n % 2 == 0).ToList();

D. var evens = numbers.ToList().Where(n => n % 2 == 0);

Solution

1. Step 1: Filter even numbers with Where()

   Where(n => n % 2 == 0) filters the list to only even numbers.

2. Step 2: Use ToList() for immediate execution

   Calling ToList() after filtering runs the query immediately and returns a list of even numbers.

3. Final Answer:

   var evens = numbers.Where(n => n % 2 == 0).ToList(); -> Option B

4. Quick Check:

   Filter then ToList() = immediate even list [OK]

Hint: Chain Where() then ToList() for immediate filtered list [OK]

Common Mistakes:

• Not calling ToList() to force immediate execution
• Calling ToList() before Where(), which returns full list
• Using Select() incorrectly to filter