🚀 C-based hashmap with 🔑 char* keys and 🔢 integer values. Supports setting/getting values, deletion, and auto-resizing.
-
Updated
Jul 21, 2024 - C
🚀 C-based hashmap with 🔑 char* keys and 🔢 integer values. Supports setting/getting values, deletion, and auto-resizing.
This repository explores the implementation of two fundamental data structures in C. Stacks are used for managing data with a last-in-first-out approach, while queues operate with a first-in-first-out strategy. Understanding and utilizing these data structures is essential for efficient algorithm design and data management in C programming.
Grade 11 Co-op Course - Dr. Caron University of Windsor
The Closest Pair Problem - Divide and Conquer algorithm - 2020
Algorithm Design 1 - C Codes
Add a description, image, and links to the algorithm-design topic page so that developers can more easily learn about it.
To associate your repository with the algorithm-design topic, visit your repo's landing page and select "manage topics."