RubyGems Navigation menu

data_structures_rmolinari 0.2.1

This small gem contains several data structures that I have implemented to learn how they work. Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code. Actually implementing the structure is often helpful in understanding what is going on. It is also usually fun. We implement Disjoin Union, Heap, Priority Search Tree, and Segment Tree.

Gemfile:
=

install:
=

Versions:

  1. 0.5.8 December 08, 2025 (86 KB)
  2. 0.5.7 January 04, 2024 (69.5 KB)
  3. 0.5.6 January 04, 2024 (69.5 KB)
  4. 0.5.5 December 19, 2023 (69 KB)
  5. 0.5.4 December 12, 2023 (69 KB)
  6. 0.2.1 January 05, 2023 (26.5 KB)
Show all versions (19 total)

Runtime Dependencies (1):

must_be ~> 1.1.0

Development Dependencies (3):

byebug ~> 11.1.3
ruby-prof ~> 1.4.5
simplecov ~> 0.22.0

Owners:

Pushed by:

Authors:

  • Rory Molinari

SHA 256 checksum:

=

Total downloads 11,377

For this version 555

Version Released:

License:

MIT

Required Ruby Version: ~> 3.1.3

Links: