Writing first Rust program - Time & Space Complexity

Time Complexity: Writing first Rust program

O(1)

Understanding Time Complexity

When writing your first Rust program, it is helpful to understand how the program's steps grow as you add more instructions or data.

We want to see how the time to run changes when the program gets bigger or more complex.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

fn main() {
    println!("Hello, world!");
}

This code prints a simple greeting message once to the screen.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Printing one message once.
• How many times: Exactly one time.

How Execution Grows With Input

Explain the growth pattern intuitively.

Input Size (n)	Approx. Operations
1	1 print operation
10	1 print operation (still the same)
100	1 print operation (no change)

Pattern observation: The number of operations stays the same no matter how big the input is because the program only prints once.

Final Time Complexity

Time Complexity: O(1)

This means the program takes the same amount of time to run no matter how big the input or program size is.

Common Mistake

[X] Wrong: "Printing a message once takes longer if the program is bigger."

[OK] Correct: The program only prints once, so the time does not grow with input size here.

Interview Connect

Understanding simple time complexity like this builds your confidence to analyze bigger programs later. It shows you how to think about how code runs as it grows.

Self-Check

"What if we added a loop to print the message n times? How would the time complexity change?"