Creating and displaying data in No-Code - Performance & Efficiency

Time Complexity: Creating and displaying data

O(n)

Understanding Time Complexity

When we create and show data, it takes time depending on how much data there is.

We want to know how the time needed grows as we add more data.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

data = []
for i in range(n):
    data.append(i)

for item in data:
    print(item)

This code creates a list of numbers from 0 to n-1, then prints each number.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Two loops: one to add items, one to print items.
• How many times: Each loop runs n times, where n is the number of items.

How Execution Grows With Input

As the number of items grows, the time to create and show them grows too.

Input Size (n)	Approx. Operations
10	About 20 operations (10 adds + 10 prints)
100	About 200 operations
1000	About 2000 operations

Pattern observation: The total work grows roughly twice as fast as n, so it grows linearly.

Final Time Complexity

Time Complexity: O(n)

This means the time needed grows in direct proportion to the number of items.

Common Mistake

[X] Wrong: "Adding and printing data takes constant time no matter how much data there is."

[OK] Correct: Each item added and printed takes time, so more items mean more time.

Interview Connect

Understanding how creating and showing data scales helps you explain efficiency clearly in real projects.

Self-Check

"What if we printed only every other item? How would the time complexity change?"