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?

Almost certainly it is linear, although I suppose the total could be calculated each time the dict is modified and then the method just retrieves this total, but I doubt it — juanpa.arrivillaga
– juanpa.arrivillaga, Commented Dec 2, 2021 at 23:51

rchome · Accepted Answer · 2021-12-02 23:44:14Z

5

In CPython, it looks like it implements total() using sum(self.values()), so it's O(number of values in the Counter).

answered Dec 2, 2021 at 23:44

rchome

2,72310 silver badges22 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

What's the time complexity of Python's collections.Counter.total()?

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related