awesome-repositories.com
المدونة
MCP
awesome-repositories.com

اكتشف أفضل مستودعات المصادر المفتوحة باستخدام بحث مدعوم بالذكاء الاصطناعي.

استكشفعمليات بحث منسقةبدائل مفتوحة المصدربرمجيات ذاتية الاستضافةالمدونةخريطة الموقع
المشروعخادم 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

اعثر على أفضل المستودعات باستخدام الذكاء الاصطناعي.سنبحث عن أفضل المستودعات المطابقة باستخدام الذكاء الاصطناعي.
  • coells/100daysالصورة الرمزية لـ coells

    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-tableالصورة الرمزية لـ jamesroutley

    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