awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 个仓库

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

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • coells/100dayscoells 的头像

    coells/100days

    7,488在 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
    在 GitHub 上查看↗7,488
  • jamesroutley/write-a-hash-tablejamesroutley 的头像

    jamesroutley/write-a-hash-table

    4,345在 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
    在 GitHub 上查看↗4,345
  1. Home
  2. Part of an Awesome List
  3. Databases & Data
  4. Data Structures
  5. Open Addressing Implementations