Nullable value types in C Sharp (C#) - Time & Space Complexity

Time Complexity: Nullable value types

O(n)

Understanding Time Complexity

Let's see how the time it takes to run code with nullable value types changes as the input grows.

We want to know how the program's steps increase when working with nullable values.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

int?[] numbers = new int?[n];
for (int i = 0; i < n; i++)
{
    if (numbers[i].HasValue)
    {
        Console.WriteLine(numbers[i].Value);
    }
}
    

This code goes through an array of nullable integers and prints the value if it exists.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each element in the array once.
• How many times: Exactly n times, where n is the array size.

How Execution Grows With Input

As the array gets bigger, the program checks more elements one by one.

Input Size (n)	Approx. Operations
10	About 10 checks
100	About 100 checks
1000	About 1000 checks

Pattern observation: The number of steps grows directly with the size of the input.

Final Time Complexity

Time Complexity: O(n)

This means the time to finish grows in a straight line as the input size grows.

Common Mistake

[X] Wrong: "Checking if a nullable has a value makes the code slower in a way that changes the overall time complexity."

[OK] Correct: Checking if a nullable has a value is a simple step done once per item, so it does not change the overall linear growth.

Interview Connect

Understanding how loops work with nullable types helps you explain how your code handles optional data efficiently.

Self-Check

"What if we nested another loop inside to check each element multiple times? How would the time complexity change?"