docs(help): add interactive Hashing help menu, comparative guide, and use-cases

[vedant-kawale-27]

PR Description:

Overview

This PR addresses the missing interactive documentation for the Hashing Algorithms module. It implements a dedicated help menu explaining the collision resolution strategies, their mathematical formulas, core tradeoffs, and real-world industrial usage.

Proposed Changes

1. 📖 Interactive Hashing Help Pages

• Files:
  • [NEW] help_hashing.c
  • [MODIFY] help.h
  • [MODIFY] help.c
• Description: Added Option 5 (Hashing Help) to the main interactive help guide (help.c). It introduces a sub-menu covering:
  • Introduction to Hashing: Conceptual explanation of hashing, hash functions, and collisions.
  • Linear Probing: Step-by-step probing search algorithm, formula, and explanation of primary clustering.
  • Separate Chaining: Node chaining mechanism, load factor benefits, and memory tradeoffs.
  • Quadratic Probing: Offsets mechanism, formula, and secondary clustering explanation.
  • Double Hashing: Step size computation using secondary hash functions to minimize clustering.
  • Relationships & Real-world Use Cases: Comprehensive comparative breakdown:
    • Open Addressing vs. Closed Addressing tradeoffs (e.g., Cache Locality vs. pointer chasing, memory compaction, deletions overhead).
    • Decision Matrix on when to select which algorithm.
    • Industry Implementations: Real-world usage details (e.g., Java HashMap chaining tree conversions, C++ std::unordered_map bucket lists, Python dict open addressing lookups).

---

Verification Done

1. Verified compiler syntax checks:

   gcc -Wall -Wextra -Werror -std=c11 -c help/help_hashing.c -Ihelp -Isrc/utils
   gcc -Wall -Wextra -Werror -std=c11 -c help/help.c -Ihelp -Isrc/utils

   Both compiled successfully with zero errors/warnings.
2. Verified that the help manual structure runs seamlessly and menu transitions work correctly.

#855

[Copilot]

Copilot was unable to review this pull request because the user who requested the review has reached their quota limit.