What's the time complexity of Python's collections.Counter.total()?
Question
What's the time complexity of Python's collections.Counter.total()? I've read the documentation for the method , but there's not mention of its efficiency. Does anyone know how the method is implemented under the hood and what its time complexity is?
1 answers
solution1
3 2021-12-02 23:44:14
In CPython, it looks like it implements total() using sum(self.values()) , so it's O(number of values in the Counter) .
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.
Related Question
What is the time complexity of collections.Counter() in Python?
What's the time complexity of constructing a Counter object from an iterable in Python?
What's the time complexity of prod() in math in Python
What's the time complexity of list access in Python?
What's the time complexity for the following python function?
Why is my python collections Counter returning 1's?
What's the time complexity for the loops?
What's the time complexity of Python built-in Function `all()`
What's the time complexity for some python list operations?
The time complexity of Python's Loop
Related Tags