Update disjoint_set_union.md

turkhuu622 · web-flow · commit b86247acb5f0 · 2025-12-15T02:10:23.000+01:00
diff --git a/src/data_structures/disjoint_set_union.md b/src/data_structures/disjoint_set_union.md
@@ -314,9 +314,9 @@ for (int i = m-1; i >= 0; i--) {
 }
 ```
 
-There is one optimization:
-We can use **union by rank**, if we store the next unpainted cell in an additional array `end[]`.
-Then we can merge two sets into one ranked according to their heuristics, and we obtain the solution in $O(\alpha(n))$.
+There is an optimization:
+We can use union by rank / size, if we store the next unpainted cell in an additional array `end[]`.
+Then we can merge two sets into one according to their heuristics, and we obtain the solution in $O(\alpha(n))$.
 
 ### Support distances up to representative
 
