One-time payments in No-Code - Time & Space Complexity

Time Complexity: One-time payments

O(n)

Understanding Time Complexity

We want to understand how the time to process one-time payments changes as the number of payments grows.

How does the work increase when more payments are handled?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

for each payment in paymentList:
    process payment once
    record payment details
    send confirmation

This code processes each payment one time, handling its details and sending a confirmation.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Loop over each payment to process it once.
• How many times: Exactly once per payment, so as many times as there are payments.

How Execution Grows With Input

As the number of payments increases, the total work grows directly with it.

Input Size (n)	Approx. Operations
10	10 operations
100	100 operations
1000	1000 operations

Pattern observation: Doubling the number of payments doubles the work needed.

Final Time Complexity

Time Complexity: O(n)

This means the time to process payments grows in a straight line with the number of payments.

Common Mistake

[X] Wrong: "Processing one payment takes the same total time no matter how many payments there are."

[OK] Correct: Each payment adds extra work, so total time increases as more payments come in.

Interview Connect

Understanding how work grows with input size helps you explain system behavior clearly and confidently in real situations.

Self-Check

"What if we processed payments in batches instead of one by one? How would the time complexity change?"