Python collections.Counter: most_common complexity
From the source code of collections.py, we see that if we don’t specify a number of returned elements, most_common returns a sorted list of the counts. This is an O(n log n) algorithm. If we use most_common to return k > 1 elements, then we use heapq.nlargest. This is an O(k) + O((n – k) … Read more