From 8a8de126c13c514415c8c1b4ef589ca29babe691 Mon Sep 17 00:00:00 2001 From: Bruno BELANYI Date: Wed, 26 Jun 2024 13:42:50 +0000 Subject: [PATCH] posts: union-find: fix typo --- content/posts/2024-06-24-union-find/index.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/content/posts/2024-06-24-union-find/index.md b/content/posts/2024-06-24-union-find/index.md index e358205..fbfde55 100644 --- a/content/posts/2024-06-24-union-find/index.md +++ b/content/posts/2024-06-24-union-find/index.md @@ -94,7 +94,7 @@ def find(self, elem: int) -> int: However, going back up the chain of parents each time we want to find the root node (an `O(n)` operation) would make for disastrous performance. Instead we can -do a small optimization called _path splitting. +do a small optimization called _path splitting_. ```python def find(self, elem: int) -> int: