Skip to content

A repository for Data Structures and Algorithms (DSA) implemented in C++. A place to practice and reinforce fundamental concepts: Graph data structure, sort algorithm.

Notifications You must be signed in to change notification settings

caogiathinh/data-structures-algorithms

Repository files navigation

DSA (Data Structures & Algorithms)

Welcome to the DSA repository!
This project is a resource focused on Data Structures and Algorithms (DSA) for learners and practitioners. It includes concise documents, explanations, and reference materials covering essential algorithms and data structure concepts.


Table of Contents


About

This repository provides curated resources, algorithm descriptions, and solutions for common DSA problems. Materials are provided in PDF and DOCX formats, making them easy to read and print for study or interview preparation.


Repository Structure

All documents are located in the root directory. The main provided resources are:

  • PDFs: Algorithm guides and explanations.
  • DOCX files: Editable source documents for study notes and presentations.

Main Files

File Name Description
bellmanFord.pdf Bellman-Ford algorithm overview
bfs_dfs.docx Breadth-First Search & Depth-First Search
bfs_dfs.pdf Breadth-First Search & Depth-First Search
bfs_dfs.pdf.docx BFS & DFS combined notes
counting.pdf Counting algorithms and techniques
counting.pdf.docx Counting algorithms (editable)
counting_giaithuat.pdf Counting algorithm solutions
dijkstra.pdf Dijkstra's shortest path algorithm
dijkstra_gt2.pdf Extended Dijkstra explanations
graph.docx Fundamentals of graph theory
graph2.docx Advanced graph theory notes
graph2.pdf Advanced graph theory reference
prim.pdf Prim's Minimum Spanning Tree algorithm

Main Resources

  • Algorithms covered include: Bellman-Ford, BFS, DFS, Counting, Dijkstra, Prim, and others.
  • Each topic is provided in both PDF and DOCX format for convenience.

Getting Started

  1. Clone the repository:

    git clone https://github.com/caogiathinh/DSA.git
    cd DSA
  2. Browse documents:
    Open any .pdf or .docx file for explanations and reference material.

  3. Study and Practice:
    Use the documents to learn core algorithms and review technical details.


Contributing

Contributions are welcome!
You can add new documents, improve existing explanations, or share additional algorithm references.

How to contribute:

  1. Fork the repository.
  2. Add or update documents.
  3. Open a Pull Request with a clear description of your changes.

License

This project is licensed under the MIT License.


Acknowledgements

  • Based on open-source and educational materials.
  • Thanks to the community for ongoing support and resource sharing.

For questions or suggestions, please open an issue or contact the repository maintainer.

About

A repository for Data Structures and Algorithms (DSA) implemented in C++. A place to practice and reinforce fundamental concepts: Graph data structure, sort algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published