Argument order rules in Python - Time & Space Complexity

Time Complexity: Argument order rules

O(n)

Understanding Time Complexity

When we write functions, the order of arguments can affect how the function runs, especially when some arguments are optional or have default values.

We want to see how the order of arguments impacts the number of steps the program takes.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def greet(name, greeting="Hello", punctuation="!"):
    print(f"{greeting}, {name}{punctuation}")

greet("Alice")
greet("Bob", "Hi")
greet("Carol", punctuation=".")

This function prints a greeting message using required and optional arguments in a specific order.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The function call and string formatting happen once per call.
• How many times: Each call runs a fixed number of steps regardless of input size.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
1 call	Constant steps (format and print)
10 calls	10 times the constant steps
100 calls	100 times the constant steps

Pattern observation: Each call takes the same amount of work, so total work grows linearly with the number of calls.

Final Time Complexity

Time Complexity: O(n)

This means the total time grows directly with how many times the function is called, not with the argument order itself.

Common Mistake

[X] Wrong: "Changing the order of arguments changes how fast the function runs."

[OK] Correct: The order of arguments affects how you call the function but does not change the number of steps inside the function.

Interview Connect

Understanding argument order helps you write clear code and avoid mistakes, which is a valuable skill in any coding task or interview.

Self-Check

"What if we added a loop inside the function that repeats based on an argument? How would the time complexity change?"