Timeline for Why is the path compression (no rank) for disjoint sets $O(\log n)$ amortized for Find-Set?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22, 2016 at 3:28 | history | edited | templatetypedef | CC BY-SA 3.0 |
LaTeX fix in the title
|
| Dec 4, 2015 at 21:14 | history | tweeted | twitter.com/StackCompSci/status/672886795940585472 | ||
| Dec 4, 2015 at 18:40 | answer | added | templatetypedef | timeline score: 5 | |
| Dec 4, 2015 at 9:06 | history | asked | Charlie Parker | CC BY-SA 3.0 |