What is the computational cost of using any() or not any()?
The any() built-in checks if any element is True in an iterable. I would suppose it needs to check all the elements it is applied to, so I would assume the cost to be O(n).
4
-
2Refer to any.Mechanic Pig– Mechanic Pig2022-09-12 06:59:47 +00:00Commented Sep 12, 2022 at 6:59
-
1O(n); it checks every element passed as argumentNicoCaldo– NicoCaldo2022-09-12 07:00:44 +00:00Commented Sep 12, 2022 at 7:00
-
Does this answer your question? How do Python's any and all functions work?Mechanic Pig– Mechanic Pig2022-09-12 07:01:37 +00:00Commented Sep 12, 2022 at 7:01
-
None of those mentioned computational cost, hence why this is in a separate question.DarknessPlusPlus– DarknessPlusPlus2022-09-12 07:07:37 +00:00Commented Sep 12, 2022 at 7:07
Add a comment
|
1 Answer
Looking to the documentation it says the function any is equivalent to:
def any(iterable):
for element in iterable:
if element:
return True
return False
So we can assume the computational cost is, as you state, O(n).
