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:
=

installation:
=

Versions:

  1. 0.5.8 December 08, 2025 (86 ko)
  2. 0.5.7 January 04, 2024 (69,5 ko)
  3. 0.5.6 January 04, 2024 (69,5 ko)
  4. 0.5.5 December 19, 2023 (69 ko)
  5. 0.5.4 December 12, 2023 (69 ko)
  6. 0.2.1 January 05, 2023 (26,5 ko)
Voir toutes les versions (19)

Dépendances de Runtime (1):

must_be ~> 1.1.0

Dépendances de Development (3):

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

Propriétaires:

Pushed by:

Auteurs:

  • Rory Molinari

Total de contrôle SHA 256:

=

Total de téléchargements 11 666

Pour cette version 567

Version publiée:

License:

MIT

Version de Ruby requise: ~> 3.1.3

Liens: