np.any() and np.all() in NumPy - Time & Space Complexity

Time Complexity: np.any() and np.all()

O(n)

Understanding Time Complexity

We want to understand how the time it takes to check conditions on arrays grows as the array gets bigger.

Specifically, how fast do np.any() and np.all() run when used on large arrays?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import numpy as np

arr = np.random.randint(0, 2, size=1000, dtype=bool)
result_any = np.any(arr)
result_all = np.all(arr)

This code creates a boolean array and checks if any or all elements are True.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Scanning each element in the array once.
• How many times: Up to n times, where n is the number of elements in the array (may stop early).

How Execution Grows With Input

As the array size grows, the time to check grows roughly in proportion to the number of elements.

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 operations grows linearly with the input size.

Final Time Complexity

Time Complexity: O(n)

This means the time to check grows in a straight line as the array gets bigger.

Common Mistake

[X] Wrong: "np.any() and np.all() always scan every element in the array, with no short-circuiting."

[OK] Correct: NumPy's functions do short-circuit and stop early like Python's any() and all().

Interview Connect

Understanding how these checks scale helps you reason about performance when working with large data arrays, a common task in data science.

Self-Check

"What if we used np.any() or np.all() on a multi-dimensional array with an axis argument? How would the time complexity change?"