Time Complexity: Comparison operators
O(n)
0
0
Comparison operators in R Programming - Time & Space Complexity
Understanding Time Complexity
We want to understand how long it takes to compare values using comparison operators in R.
How does the time needed change when we compare more items?
Scenario Under Consideration
Analyze the time complexity of the following code snippet.
values <- c(3, 7, 2, 9, 5)
results <- logical(length(values))
for (i in seq_along(values)) {
results[i] <- values[i] > 4
}This code checks each number in a list to see if it is greater than 4.
Identify Repeating Operations
- Primary operation: Comparing each element to the number 4 using > operator.
- How many times: Once for each element in the list.
How Execution Grows With Input
Each new item adds one more comparison to do.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | 10 comparisons |
| 100 | 100 comparisons |
| 1000 | 1000 comparisons |
Pattern observation: The number of comparisons grows directly with the number of items.
Final Time Complexity
Time Complexity: O(n)
This means the time to compare grows in a straight line as the list gets bigger.
Common Mistake
[X] Wrong: "Comparing many items is instant and does not depend on list size."
[OK] Correct: Each item needs its own comparison, so more items mean more time.
Interview Connect
Understanding how comparison operations scale helps you write efficient code and explain your thinking clearly.
Self-Check
"What if we compared every item to every other item? How would the time complexity change?"