Boolean type behavior in C Sharp (C#) - Time & Space Complexity

Time Complexity: Boolean type behavior

O(n)

Understanding Time Complexity

Let's explore how the time it takes to run code with Boolean values changes as we work with more data.

We want to see how the program's speed changes when using Boolean operations on different input sizes.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

bool[] flags = new bool[n];
int countTrue = 0;
for (int i = 0; i < n; i++)
{
    if (flags[i])
    {
        countTrue++;
    }
}

This code counts how many true values are in a Boolean array of size n.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking each Boolean value in the array once.
• How many times: Exactly n times, once for each element.

How Execution Grows With Input

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

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

Pattern observation: The number of checks grows directly with the size of the array.

Final Time Complexity

Time Complexity: O(n)

This means the time to count true values grows in a straight line as the array gets bigger.

Common Mistake

[X] Wrong: "Checking Boolean values is instant and does not depend on array size."

[OK] Correct: Even though each check is fast, the program must check every element, so more elements mean more total time.

Interview Connect

Understanding how simple Boolean checks scale helps you explain how your code handles larger data clearly and confidently.

Self-Check

"What if we used nested loops to compare Boolean values pairwise? How would the time complexity change?"