Static group membership in Kafka - Time & Space Complexity

Time Complexity: Static group membership

O(n)

Understanding Time Complexity

When Kafka assigns static group members, it needs to manage group membership efficiently.

We want to know how the time to assign members grows as the group size increases.

Scenario Under Consideration

Analyze the time complexity of the following Kafka static group membership assignment code.

// Simplified static group membership assignment
for (Member member : groupMembers) {
    if (member.isStatic()) {
        assignMemberToGroup(member);
    }
}

This code loops through all group members and assigns those marked as static to the group.

Identify Repeating Operations

Look for repeated actions that affect time.

• Primary operation: Looping through each group member once.
• How many times: Exactly once per member, so as many times as there are members.

How Execution Grows With Input

As the number of group members grows, the code checks each member once.

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

Pattern observation: The work grows directly with the number of members.

Final Time Complexity

Time Complexity: O(n)

This means the time to assign static members grows in a straight line as the group size grows.

Common Mistake

[X] Wrong: "Assigning static members is instant and does not depend on group size."

[OK] Correct: Each member must be checked and assigned, so time grows with the number of members.

Interview Connect

Understanding how group membership scales helps you explain system behavior clearly and confidently.

Self-Check

"What if the code used a map to find static members instead of looping? How would the time complexity change?"