Logical patterns (and, or, not) in C Sharp (C#) - Time & Space Complexity

Time Complexity: Logical patterns (and, or, not)

O(n)

Understanding Time Complexity

We want to understand how the time to run logical checks changes as we add more conditions.

How does combining many true/false checks affect the work done?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

bool CheckAllConditions(bool[] conditions) {
    bool result = true;
    foreach (bool cond in conditions) {
        result = result && cond;
    }
    return result;
}
    

This code checks if all conditions in an array are true using the AND pattern.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each condition in the array.
• How many times: Once for each condition in the input array.

How Execution Grows With Input

As the number of conditions grows, the code checks each one in order.

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

Pattern observation: The work grows directly with the number of conditions.

Final Time Complexity

Time Complexity: O(n)

This means the time to check all conditions grows in a straight line as you add more conditions.

Common Mistake

[X] Wrong: "Logical AND or OR operations always take the same time no matter how many conditions there are."

[OK] Correct: Each condition usually needs to be checked one by one, so more conditions mean more work.

Interview Connect

Understanding how logical checks scale helps you explain how your code handles many conditions efficiently and clearly.

Self-Check

"What if we stop checking as soon as one condition is false? How would the time complexity change?"