Skip to content

Commonest

Status: Stable

documented, exercised by the test suite and/or worked examples, with no known limitations recorded.

Description

Commonest[list]

gives a list of the elements that are the most common in list.

Commonest[list, n]

gives a list of the n most common elements in list.

Examples (5)

Every input below was run against the current Mathilda build and its output recorded.

Basic examples (2)

In[1]:= Tally[<|"a" -> 1, "b" -> 1, "c" -> 2|>]
Out[1]= {{1, 2}, {2, 1}}

In[2]:= Commonest[<|"a" -> 1, "b" -> 1, "c" -> 2|>]
Out[2]= {1}

Applications (3)

In[3]:= Commonest[{1, 2, 2, 3, 3, 3, 4}]
Out[3]= {3}

In[4]:= Commonest[{a, b, a, c, b, a, d, b}, 2]
Out[4]= {a, b}

In[5]:= Commonest[Table[Mod[k^2, 7], {k, 0, 20}]]
Out[5]= {1, 4, 2}

Implementation notes

Algorithm. builtin_commonest (in src/list.c) tallies element multiplicities with a HashTable (one pass, O(N)), recording each distinct element's count and first-appearance index. The tallies are packed into CommonestItem records and sorted by descending count (ties broken by first occurrence) to find the maximum multiplicity. Without a count argument it returns every element sharing the maximum count; Commonest[list, n] / Commonest[list, UpTo[n]] returns up to the n most frequent.

Data structures. Parallel Expr** / int64_t* arrays for unique elements and their multiplicities, a HashTable mapping element ā†’ index, and a CommonestItem array (element, count, first_index) used for the stable sort.

Attributes: Protected.

References

See also: Tally, Counts, CountsBy

Notes & additional examples

Notes

Commonest[list] returns every element tied for the highest frequency; Commonest[list, n] returns the n most common. The quadratic-residue example above shows the three nonzero residues mod 7 each occurring equally often.