data_structures_rmolinari
This small gem contains several data structures that I have implemented in Ruby to learn how they work. Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code. Actually implementing it is often helpful in understanding what is going on. It is also usually fun. The gem contains basic implementions of Disjoint Union, Heap, Priority Search Tree, and Segment Tree. See the homepage for more details.
View on Github
Activity
- Latest release
- 9mo ago
- Total releases
- 19
- Cadence
- ~daily
- Last 12 months
- 1
Reach
- Stars
- —
Details
- License
- MIT
- First release
- Jan 04, 2023
Releases
| Version | Released | |
|---|---|---|
0.5.8
patch
| ||
0.5.7
patch
| ||
0.5.6
patch
| ||
0.5.5
patch
| ||
0.5.4
patch
| ||
0.5.3
patch
| ||
0.5.2
patch
| ||
0.5.1
patch
| ||
0.5.0
minor
| ||
0.4.4
patch
| ||
0.4.3
patch
| ||
0.4.2
patch
| ||
0.4.1
patch
| ||
0.4.0
minor
| ||
0.2.2
patch
| ||
0.3.0
minor
| ||
0.2.1
patch
| ||
0.2.0
minor
| ||
0.1.0
initial
|