useradd and userdel in Linux CLI - Time & Space Complexity

Time Complexity: useradd and userdel

O(n)

Understanding Time Complexity

When using commands like useradd and userdel, it's helpful to understand how their execution time changes as the number of users grows.

We want to know how the time to add or delete a user changes when the system has more users.

Scenario Under Consideration

Analyze the time complexity of these commands:

useradd newuser
userdel olduser

These commands add or remove a user account on a Linux system by updating system files.

Identify Repeating Operations

Look at what happens inside these commands:

• Primary operation: Searching and updating user records in system files like /etc/passwd and /etc/shadow.
• How many times: The system reads through these files once per command to find or add the user.

How Execution Grows With Input

As the number of users (n) increases, the time to find or update a user grows roughly in a straight line.

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

Pattern observation: The time grows directly with the number of users because the system scans the user list line by line.

Final Time Complexity

Time Complexity: O(n)

This means the time to add or delete a user grows linearly with the number of existing users.

Common Mistake

[X] Wrong: "Adding or deleting a user takes the same time no matter how many users exist."

[OK] Correct: The system must scan user files line by line, so more users mean more lines to check, increasing time.

Interview Connect

Understanding how simple system commands scale helps you reason about performance in real systems, a useful skill in scripting and automation roles.

Self-Check

"What if the system used a database instead of text files for users? How would the time complexity change?"