Boolean type and logical operators in Kotlin - Time & Space Complexity

Time Complexity: Boolean type and logical operators

O(n)

Understanding Time Complexity

We want to see how the time it takes to run code with Boolean values and logical operators changes as the input changes.

Specifically, we ask: how does the number of operations grow when we use Boolean checks and logical operations?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

fun checkConditions(values: List): Boolean {
    for (value in values) {
        if (value && someOtherCheck()) {
            return true
        }
    }
    return false
}

fun someOtherCheck(): Boolean {
    return true
}
    

This code checks a list of Boolean values and returns true if any value is true and passes another check.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each Boolean in the list.
• How many times: Up to once per item, until a true condition is found.

How Execution Grows With Input

As the list gets bigger, the code checks more items, but it may stop early if a true is found.

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

Pattern observation: The number of checks grows roughly in direct proportion to the list size, but can stop sooner.

Final Time Complexity

Time Complexity: O(n)

This means the time to run grows roughly in a straight line with the number of Boolean values checked.

Common Mistake

[X] Wrong: "Logical operators like && or || always make the code run faster or slower regardless of input size."

[OK] Correct: Logical operators themselves are simple checks; the main time depends on how many times the code loops or checks values, not just the operators.

Interview Connect

Understanding how Boolean checks and loops affect time helps you explain how your code scales and why it runs efficiently or not.

Self-Check

"What if we changed the loop to check all values without stopping early? How would the time complexity change?"