I tried to find the proof of the complexity of the Union-Find algorithm (The one that utilizes union by rank and path compression) but I couldn't find it anywhere, so please comment a link or something :D
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
I tried to find the proof of the complexity of the Union-Find algorithm (The one that utilizes union by rank and path compression) but I couldn't find it anywhere, so please comment a link or something :D
Name |
---|
Here, first of it's kind. And here you can try another links, DSU has long history)
DSU complexity? Proof???
Typical red user — can't do anything on his own way.