Compare commits
5 commits
566e4e746e
...
879fd3a24a
Author | SHA1 | Date | |
---|---|---|---|
Bruno BELANYI | 879fd3a24a | ||
Bruno BELANYI | 6af1bbc1c7 | ||
Bruno BELANYI | 87931fc981 | ||
Bruno BELANYI | 51fa136427 | ||
Bruno BELANYI | 8f040fb9f7 |
|
@ -10,18 +10,18 @@ tags:
|
||||||
categories:
|
categories:
|
||||||
- programming
|
- programming
|
||||||
series:
|
series:
|
||||||
- Lesser known algorithms and data structures
|
- Cool algorithms
|
||||||
favorite: false
|
favorite: false
|
||||||
disable_feed: false
|
disable_feed: false
|
||||||
---
|
---
|
||||||
|
|
||||||
To kickoff the [series] of posts about criminally underrated algorithms and data
|
To kickoff the [series]({{< ref "/series/cool-algorithms/">}}) of posts about
|
||||||
structures, I will be talking about my favorite one: the [_Disjoint Set_][wiki].
|
algorithms and data structures I find interesting, I will be talking about my
|
||||||
Also known as the _Union-Find_ data structure, so named because of its two main
|
favorite one: the [_Disjoint Set_][wiki]. Also known as the _Union-Find_ data
|
||||||
operations: `ds.union(lhs, rhs)` and `ds.find(elem)`.
|
structure, so named because of its two main operations: `ds.union(lhs, rhs)` and
|
||||||
|
`ds.find(elem)`.
|
||||||
|
|
||||||
[wiki]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
|
[wiki]: https://en.wikipedia.org/wiki/Disjoint-set_data_structure
|
||||||
[series]: {{< ref "/series/lesser-known-algorithms-and-data-structures/">}}
|
|
||||||
|
|
||||||
<!--more-->
|
<!--more-->
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue