This repository contains C++ libraries implementing fundamental data structures, including vectors, lists, stacks, queues, trees, and hash tables. These libraries were developed as part of the "Laboratory of Algorithms and Data Structures" course taught by Professor Fabio Mogavero at the University of Naples "Federico II".
The libraries in this repository provide comprehensive implementations of various data structures commonly used in computer science and software development. These structures are essential for organizing and manipulating data efficiently in various applications and algorithms.
- Vectors: Dynamic arrays that can resize themselves automatically.
- Lists: Linear collections of elements, each pointing to the next one.
- Stacks: Last-in, first-out (LIFO) data structures.
- Queues: First-in, first-out (FIFO) data structures.
- Trees: Hierarchical structures with nodes connected by edges.
- Hash Tables: Data structures that store key-value pairs, allowing fast retrieval based on keys.
To use these libraries, simply clone the repository to your local machine and include the desired header files in your C++ projects.
git clone https://github.com/vinsgiordi/LASD-Libraries.gitGo to the root of the exercise you want to try and run the following command
make clean && make && ./mainContributions to this repository are welcome! If you have suggestions for improvements, bug fixes, or new features, please open an issue or submit a pull request.
This repository is licensed under the MIT License.
For any inquiries or assistance, feel free to contact vincenzogiordano99@libero.it.