Port mapping with -p flag in Docker - Time & Space Complexity

Time Complexity: Port mapping with -p flag

O(n)

Understanding Time Complexity

When using Docker's port mapping with the -p flag, it's helpful to understand how the system handles these mappings as you add more ports.

We want to see how the work grows when mapping multiple ports.

Scenario Under Consideration

Analyze the time complexity of the following Docker command snippet.

docker run -d \
  -p 8080:80 \
  -p 8081:81 \
  -p 8082:82 \
  my-web-server

This command runs a container and maps three host ports to three container ports using the -p flag.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Processing each -p port mapping flag.
• How many times: Once per port mapping specified (here 3 times).

How Execution Grows With Input

Each additional port mapping adds a similar amount of work to set up the mapping.

Input Size (n)	Approx. Operations
10	10 port mappings processed
100	100 port mappings processed
1000	1000 port mappings processed

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

Final Time Complexity

Time Complexity: O(n)

This means the time to set up port mappings grows linearly with how many ports you map.

Common Mistake

[X] Wrong: "Adding more ports with -p does not affect setup time because Docker handles it instantly."

[OK] Correct: Each port mapping requires Docker to configure networking rules, so more ports mean more work.

Interview Connect

Understanding how Docker handles port mappings helps you explain container networking clearly and shows you can reason about resource scaling.

Self-Check

What if we used a range of ports with a single -p flag instead of multiple flags? How would the time complexity change?