What's the time complexity of Python built-in Function `all()`

Question

How to know the time complexity of Python built-in Function all() ?

I have tried these ways but found no answer.

1. searched on official complexity documentation, but found no answer.
2. Tried to find in Python source code. But I cannot find where the algorithm all() . This is the only file about all() I found. enter image description here

Answer 1

Definitionally O(n) . It has to check the truthiness of all the values provided until it finds a falsy value. It short-circuits (if it finds a single falsy value, it stops immediately and returns False without checking the rest of the input), so in many cases it won't do all the work, but if the input is in fact all truthy, it must, by definition, check all of them, doing O(n) work. Big-O doesn't care about the possibility of short-circuiting.