a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

extra SPACE LOL

Browse source
This commit is contained in:
Michael Cao 2020-06-16 21:02:55 -05:00
parent fe14542319
commit 1a5c9113d7
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
content/5_Gold/DS.md
View file

@ -79,7 +79,7 @@ When merging two sets, you move from the smaller set to the larger set. If the s
Additionally, a set doesn't have to be an `std::set`. Many data structures can be merged, such as `std::map` or even adjacency lists.
[[info | Challenge]]
[[info | Challenge]]
| Prove that if you instead merge sets that have size equal to the depths of the subtrees, then small to large merging does $O(N)$ insert calls.
## Further Reading