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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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
Название |
---|
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.