Fixed a bug in implementation (#414)

gampu · jakobkogler · commit 60856dadc08e · 2019-03-19T20:30:31.000+01:00
diff --git a/src/data_structures/disjoint_set_union.md b/src/data_structures/disjoint_set_union.md
@@ -273,7 +273,7 @@ Therefore the complexity will be $O(\log n)$ per union (which is also quite fast
 Implementation:
 
 ```cpp
-for (int i = 0; i < L; i++) {
+for (int i = 0; i <= L; i++) {
     make_set(i);
 }
 

Original file line number	Diff line number	Diff line change
`@@ -273,7 +273,7 @@ Therefore the complexity will be $O(\log n)$ per union (which is also quite fast`
`273`	`273`	`Implementation:`
`274`	`274`
`275`	`275`	```cpp
`276`		`-for (int i = 0; i < L; i++) {`
	`276`	`+for (int i = 0; i <= L; i++) {`
`277`	`277`	`make_set(i);`
`278`	`278`	`}`
`279`	`279`