awesome-repositories.com
Blog
MCP
awesome-repositories.com

Descoperă cele mai bune repository-uri open source cu căutare AI.

ExploreazăCăutări recomandateAlternative open-sourceSoftware self-hostedBlogHartă site
ProiectServer MCPDespreCum realizăm clasamentulPresă
LegalConfidențialitateTermeni
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 repository-uri

Awesome GitHub RepositoriesOpen Addressing Implementations

Data structures that handle collisions by probing for empty slots in a contiguous array.

Distinct from Data Structures: Specifically covers the open-addressing implementation pattern, not general data structures.

Explore 2 awesome GitHub repositories matching part of an awesome list · Open Addressing Implementations. Refine with filters or upvote what's useful.

Awesome Open Addressing Implementations GitHub Repositories

Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
  • coells/100daysAvatar coells

    coells/100days

    7,488Vezi pe GitHub↗

    This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal

    Implements a hash table that uses open addressing to resolve collisions within a flat array.

    Jupyter Notebook
    Vezi pe GitHub↗7,488
  • jamesroutley/write-a-hash-tableAvatar jamesroutley

    jamesroutley/write-a-hash-table

    4,345Vezi pe GitHub↗

    This project is a pedagogical implementation of a hash table in C, built from scratch using open addressing and linear probing for collision resolution. It serves as a computer science algorithm demo, demonstrating how to construct a fundamental key-value store at a low level. The implementation covers the core operations of an associative array: inserting a key-value pair, looking up a value by its key, and deleting a pair. It uses a hash function to compute storage locations, maps hash values to array indices with the modulo operator, and resolves collisions by scanning sequentially through

    Stores all key-value pairs directly in a contiguous array, using probing to resolve collisions.

    cdata-structureshash-tables
    Vezi pe GitHub↗4,345
  1. Home
  2. Part of an Awesome List
  3. Databases & Data
  4. Data Structures
  5. Open Addressing Implementations