Why exceptions occur in Python - Performance Analysis

Time Complexity: Understanding Time Complexity

O(n)

Understanding Time Complexity

Time complexity describes how the running time or space requirements of an algorithm grow with input size.

We identify repeating operations and analyze how often they execute as input grows.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def find_element(lst, target):
    for item in lst:
        if item == target:
            return item
    return None

numbers = [1, 2, 3, 4, 5]
result = find_element(numbers, 10)

This code looks for a target value in a list and returns it if found; otherwise, it returns None.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Looping through each item in the list to check for the target.
• How many times: Up to once for each item in the list until the target is found or the list ends.

How Execution Grows With Input

As the list gets bigger, the program may need to check more items before finding the target or giving up.

Input Size (n)	Approx. Operations
10	Up to 10 checks
100	Up to 100 checks
1000	Up to 1000 checks

Pattern observation: The number of checks grows directly with the size of the list.

Final Time Complexity

Time Complexity: O(n)

This means the time to find the target grows in a straight line as the list gets longer.

Common Mistake

[X] Wrong: "This runs in constant time O(1) because it might return early."

[OK] Correct: Time complexity focuses on the worst-case scenario, where the target is not found or at the end, requiring O(n) checks.

Interview Connect

Mastering time complexity analysis lets you design scalable solutions and discuss trade-offs confidently in interviews.

Self-Check

"What if we changed the list to a set? How would the time complexity of finding the target change?"