Group_by for categorization in Ruby - Time & Space Complexity

Time Complexity: Group_by for categorization

O(n)

Understanding Time Complexity

We want to understand how the time needed to group items changes as the list gets bigger.

How does the work grow when we categorize many items?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

numbers = [1, 2, 3, 4, 5, 6]
groups = numbers.group_by { |num| num.even? }
# groups will be {true => [2, 4, 6], false => [1, 3, 5]}

This code groups numbers into two categories: even and odd.

Identify Repeating Operations

• Primary operation: Going through each number once to check if it is even or odd.
• How many times: Exactly once for each number in the list.

How Execution Grows With Input

As the list gets bigger, the time to group grows in a straight line with the number of items.

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

Pattern observation: Doubling the list size roughly doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to group items grows directly with the number of items.

Common Mistake

[X] Wrong: "Grouping takes more time because it creates many groups inside the loop."

[OK] Correct: Actually, grouping just checks each item once and adds it to a group. The number of groups does not multiply the work for each item.

Interview Connect

Knowing how grouping scales helps you explain how your code handles bigger data smoothly and shows you understand efficient data organization.

Self-Check

"What if we nested group_by calls to group items by two conditions? How would the time complexity change?"