Unless for negated conditions in Ruby - Time & Space Complexity

Time Complexity: Unless for negated conditions

O(n)

Understanding Time Complexity

We want to understand how using unless for negated conditions affects the time it takes for code to run.

How does the program's work grow when conditions are checked with unless?

Scenario Under Consideration

Analyze the time complexity of the following Ruby code snippet.

numbers = [1, 2, 3, 4, 5]
numbers.each do |num|
  unless num.even?
    puts num
  end
end

This code prints all odd numbers from the list by using unless to check if a number is not even.

Identify Repeating Operations

Look at what repeats in this code.

• Primary operation: Looping through each number in the list.
• How many times: Once for every number in the list.

How Execution Grows With Input

As the list gets bigger, the code checks each number once.

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

Pattern observation: The work grows directly with the number of items. Double the items, double the checks.

Final Time Complexity

Time Complexity: O(n)

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

Common Mistake

[X] Wrong: "Using unless makes the code run faster than if."

[OK] Correct: Both unless and if check conditions once per item, so they take the same time overall.

Interview Connect

Understanding how condition checks scale helps you explain your code choices clearly and shows you know how code runs as data grows.

Self-Check

What if we replaced unless with if and negated the condition inside? How would the time complexity change?