Algorithms and Data Structures

Working on this project gave me the opportunity to put some of these concepts into practice by implementing them in C.

The project includes sorting algorithms, a hash table, a priority queue implemented using a heap, and graph traversal using breadth-first search (BFS). It also covers unit testing and algorithmic complexity, helping me explore both the implementation and the evaluation of these solutions.

One important aspect of the project was reusing the hash table in other exercises. This helped me understand how individual data structures can become building blocks for more complex solutions, rather than remaining isolated implementations.