Assertion: set's element | /r/HasProperty | inverse ackermann function
Facets:
Source sentences:
text: Using both path compression, splitting, or halving and union by rank or size ensures that the amortized time per operation is only O ( m α ( n ) ) {\displaystyle O(m\alpha (n))}  for m disjoint-set operations on n elements, which is optimal, where α ( n ) {\displaystyle \alpha (n)} is the inverse Ackermann function.