Members (users, groups, service accounts) in GCP - Time & Space Complexity

Time Complexity: Members (users, groups, service accounts)

O(n)

Understanding Time Complexity

When managing cloud permissions, we often add members like users, groups, or service accounts to roles.

We want to understand how the time to update permissions grows as we add more members.

Scenario Under Consideration

Analyze the time complexity of adding multiple members to a role binding in a policy.

policy = getIamPolicy(resource)
role_binding = {"role": role, "members": []}
for member in members_list:
    role_binding["members"].append(member)
policy["bindings"].append(role_binding)
setIamPolicy(resource, policy)
    

This sequence fetches the current policy, adds each member to a binding, then updates the policy.

Identify Repeating Operations

Look at what repeats as we add members.

• Primary operation: Adding each member to the role binding's members list.
• How many times: Once per member in the list.

How Execution Grows With Input

Each new member requires one append operation to the binding's members list.

Input Size (n)	Approx. Api Calls/Operations
10	10 append operations
100	100 append operations
1000	1000 append operations

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

Final Time Complexity

Time Complexity: O(n)

This means the time to add members grows in a straight line as you add more members.

Common Mistake

[X] Wrong: "Adding multiple members is just one operation regardless of count."

[OK] Correct: Each member requires a separate addition, so time grows with the number of members.

Interview Connect

Understanding how permission updates scale helps you design efficient access controls and anticipate delays in large projects.

Self-Check

What if we batch all members into a single binding instead of adding them one by one? How would the time complexity change?