Theoremcore
Tarjan's union-find bound
Also called union-find amortized analysis, O(m alpha(m,n)) bound.
A sequence of m operations on n elements with union by rank and path compression takes O(m alpha(m,n)) time.
A sequence of m operations on n elements with union by rank and path compression takes O(m alpha(m,n)) time.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 5XSYZ5 Edit this page History Report an error