Skip to content

Commit 1eb61c9

Browse files
committed
Improves the wording for a few sentences.
1 parent 12fac48 commit 1eb61c9

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

Union-Find/README.markdown

+3-3
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@ What do we mean by this? For example, the Union-Find data structure could be kee
99
[ g, d, c ]
1010
[ i, j ]
1111

12-
These sets are disjoint because they have no members in common.
12+
These sets are **disjoint** because they have no members in common.
1313

1414
Union-Find supports three basic operations:
1515

@@ -24,7 +24,7 @@ The most common application of this data structure is keeping track of the conne
2424
## Implementation
2525

2626
Union-Find can be implemented in many ways but we'll look at an efficient and easy to understand implementation: Weighted Quick Union.
27-
> __PS: Variety implementation of Union-Find has been included in playground.__
27+
> __PS: Multiple implementations of Union-Find has been included in playground.__
2828
2929
```swift
3030
public struct UnionFind<T: Hashable> {
@@ -198,7 +198,7 @@ private mutating func setByIndex(_ index: Int) -> Int {
198198
```
199199
Path Compression helps keep trees very flat, thus find operation could take __ALMOST__ in __O(1)__
200200

201-
## Complexity Summary of Variety Implementation
201+
## Complexity Summary
202202

203203
##### To process N objects
204204
| Data Structure | Union | Find |

0 commit comments

Comments
 (0)