Try–catch block in C++ - Time & Space Complexity

Time Complexity: Try-catch block

O(n)

Understanding Time Complexity

We want to understand how using a try-catch block affects the time it takes for a program to run.

Specifically, does catching errors change how long the program works as the input grows?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

try {
    for (int i = 0; i < n; i++) {
        // some operation
    }
} catch (const std::exception &e) {
    std::cout << "Error caught" << std::endl;
}
    

This code tries to run a loop n times and catches any exceptions that happen.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: The for-loop running n times.
• How many times: Exactly n times, once for each loop cycle.

How Execution Grows With Input

As n grows, the loop runs more times, so the work grows directly with n.

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

Pattern observation: The work grows in a straight line as n increases.

Final Time Complexity

Time Complexity: O(n)

This means the time to run grows directly with the size of the input n.

Common Mistake

[X] Wrong: "The try-catch block makes the code slower for every loop cycle."

[OK] Correct: The try-catch block itself does not slow down the loop unless an exception actually happens. Normal execution runs at the same speed.

Interview Connect

Understanding how error handling affects performance helps you write reliable code without guessing about speed. This skill shows you think about both correctness and efficiency.

Self-Check

"What if the code inside the try block threw an exception every time? How would that affect the time complexity?"