Try–except execution flow in Python - Time & Space Complexity
When using try-except blocks, it is important to understand how the program runs depending on whether an error happens or not.
We want to see how the time the program takes changes as the input or situation changes.
Analyze the time complexity of the following code snippet.
def process_items(items):
results = []
for item in items:
try:
result = 10 / item
except ZeroDivisionError:
result = 0
results.append(result)
return results
This code tries to divide 10 by each item in a list, catching any division by zero errors and replacing those results with zero.
- Primary operation: Looping through each item in the list and performing division inside try-except.
- How many times: Once for each item in the input list.
Each item causes one division attempt and possibly an exception check.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 divisions and exception checks |
| 100 | About 100 divisions and exception checks |
| 1000 | About 1000 divisions and exception checks |
Pattern observation: The work grows directly with the number of items; doubling items roughly doubles the work.
Time Complexity: O(n)
This means the time to run grows in a straight line with the number of items processed.
[X] Wrong: "Try-except blocks make the code run much slower for all cases."
[OK] Correct: The try-except only adds a small check each time; it only slows down noticeably if many exceptions actually happen, but normal runs are close to normal speed.
Understanding how try-except affects time helps you write clear and efficient error handling, a skill valued in real projects and interviews.
"What if the except block contained a loop over the entire list? How would the time complexity change?"