Python itertools.groupby(): The Sorting Requirement Explained

Understand why grouping an unsorted sequence can split equal keys into separate groups.

What You Will Learn

itertools.groupby compares each item with its immediate neighbors; it never searches ahead to merge remote matching keys. Sort records by the grouping key before groupby() when you need a complete group per key.

The key function used for sorting must match the key function used for grouping.

Time complexity assumes a specific input structure. Include setup work such as sorting or building a lookup table when comparing complete solutions.

Step-by-Step Example

The example below makes the behavior visible with small input values that you can change safely.

from itertools import groupby
sales = [('west', 2), ('east', 3), ('west', 4)]
for region, group in groupby(sales, key=lambda row: row[0]):
    print(region, sum(row[1] for row in group))
print('After sorting:')
for region, group in groupby(sorted(sales, key=lambda row: row[0]), key=lambda row: row[0]):
    print(region, sum(row[1] for row in group))

How the Example Works

The imports provide the standard-library tools used in the demonstration: itertools.
The variable sales holds the result of [('west', 2), ('east', 3), ('west', 4)]. Later lines use that value or inspect how it changes.
The loop demonstrates when each value is processed or when cleanup and exception handling take effect.
The print() calls make the return values or state visible so you can compare them with the explanation and check your prediction.

Expected output from the example:

west 2
east 3
west 4
After sorting:
east 3
west 6

Another Example: Compare the Results

Try a second input and compare it with the first. Notice whether the result changes in type, value, order, or number of items.

from itertools import groupby
print([(key, list(group)) for key, group in groupby("AABBA")])

Expected output:

[('A', ['A', 'A']), ('B', ['B', 'B']), ('A', ['A'])]

When You Would Use This

This technique matters when a program handles larger queues, sorted records, or repeated lookups. Choose the data structure based on actual operations and the preconditions the algorithm requires. Verify boundary inputs before optimizing for speed.

Practice: Modify the Code

Compare unsorted and sorted transaction logs with repeated categories.

Verify the changed output against the behavior described above, including the relevant invalid or boundary case.

For complete parameters and version details, consult the official Python documentation.

Common Beginner Mistakes

Assuming groupby() aggregates all matching keys like SQL GROUP BY even when input is unsorted.
Consuming a one-pass iterator during an earlier check and assuming the same values remain available.

Key Takeaways

Understand why grouping an unsorted sequence can split equal keys into separate groups.
itertools.groupby compares each item with its immediate neighbors; it never searches ahead to merge remote matching keys.
The key function used for sorting must match the key function used for grouping.