Type modifiers in C - Time & Space Complexity

Time Complexity: Type modifiers

O(n)

Understanding Time Complexity

Let's see how using type modifiers affects the speed of a program.

We want to know how the program's steps grow when we use different type modifiers.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

#include <stdio.h>

void printNumbers(unsigned int n) {
    for (unsigned int i = 0; i < n; i++) {
        printf("%u\n", i);
    }
}

int main() {
    printNumbers(5);
    return 0;
}
    

This code prints numbers from 0 up to n-1 using an unsigned int type modifier.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The for-loop that prints numbers.
• How many times: It runs exactly n times, once for each number from 0 to n-1.

How Execution Grows With Input

As n grows, the number of print steps grows the same way.

Input Size (n)	Approx. Operations
10	10 print steps
100	100 print steps
1000	1000 print steps

Pattern observation: The steps increase directly with n, so doubling n doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the program takes longer in a straight line as the input number grows.

Common Mistake

[X] Wrong: "Using unsigned int makes the loop run faster or slower in time complexity."

[OK] Correct: The type modifier changes how numbers are stored, but the loop still runs n times, so time grows the same way.

Interview Connect

Understanding how type modifiers affect loops helps you explain code efficiency clearly and confidently.

Self-Check

"What if we changed the loop to count down from n to 0? How would the time complexity change?"