# jagratadeb/learndsa architecture

> Architecture diagram of the GitHub repository jagratadeb/learndsa, generated by GitDiagram from its file tree, README and a sample of source files (last updated 2026-10-05). It is an AI-made overview: check details against the source.

- Interactive diagram: https://gitdiagram.com/jagratadeb/learndsa
- Repository: https://github.com/jagratadeb/learndsa

## Overview

LearnDSA is a C/C++ learning collection, not a single application: learners choose a topic, study a standalone example, then compile and run that file to see its behavior. The examples progress from programming foundations through data structures and algorithm techniques. The graph groups those independent examples by subject; it does not imply calls between them. Topic coverage comes from the README and file tree; the sampled source shows standalone programs, but not a shared runtime or cross-topic orchestration.

Main entry points: [`01 Basic Concepts`](https://github.com/jagratadeb/learndsa/tree/main/01%20Basic%20Concepts) (Programming Basics), [`02 Main Concepts/01 Recursion`](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/01%20Recursion) (Recursion), [`02 Main Concepts/02 Array Basics`](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/02%20Array%20Basics) (Arrays and ADT), [`02 Main Concepts/04 Strings`](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/04%20Strings) (Strings)

## Diagram (Mermaid)

```mermaid
flowchart TD

subgraph group_foundations["Foundations"]
  node_basics["Programming Basics"]
  node_recursion["Recursion"]
end

subgraph group_data["Data Structures"]
  node_arrays["Arrays and ADT"]
  node_strings["Strings"]
  node_matrices["Matrices"]
  node_polynomials["Polynomials"]
  node_linkedlists["Linked Lists"]
  node_stacks["Stacks"]
  node_queues["Queues"]
  node_trees["Trees"]
  node_heaps["Heaps"]
  node_hashing["Hashing"]
end

subgraph group_algorithms["Algorithms"]
  node_sorting["Sorting"]
  node_graphs["Graph Traversal"]
  node_divideconquer["Divide and Conquer"]
  node_greedy["Greedy Methods"]
  node_dynamic["Dynamic Programming"]
end

subgraph group_specialized["Specialized Topics"]
end

node_learner(("Learner"))
node_compiler["C/C++ Compiler"]
node_program["Compiled Example"]

node_learner -->|"studies examples"| node_basics
node_learner -->|"studies examples"| node_recursion
node_learner -->|"studies examples"| node_arrays
node_learner -->|"studies examples"| node_strings
node_learner -->|"studies examples"| node_matrices
node_learner -->|"studies examples"| node_polynomials
node_learner -->|"studies examples"| node_linkedlists
node_learner -->|"studies examples"| node_stacks
node_learner -->|"studies examples"| node_queues
node_learner -->|"studies examples"| node_trees
node_learner -->|"studies examples"| node_heaps
node_learner -->|"studies examples"| node_hashing
node_learner -->|"studies examples"| node_sorting
node_learner -->|"studies examples"| node_graphs
node_learner -->|"studies examples"| node_divideconquer
node_learner -->|"studies examples"| node_greedy
node_learner -->|"studies examples"| node_dynamic
node_learner -->|"compiles file"| node_compiler
node_compiler -->|"produces executable"| node_program

click node_basics "https://github.com/jagratadeb/learndsa/tree/main/01%20Basic%20Concepts"
click node_recursion "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/01%20Recursion"
click node_arrays "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/02%20Array%20Basics"
click node_strings "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/04%20Strings"
click node_matrices "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/05%20Matrix"
click node_polynomials "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/06%20Polynomials"
click node_linkedlists "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/07%20Linked%20List"
click node_stacks "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/08%20Stack"
click node_queues "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/09%20Queue"
click node_trees "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/10%20Trees"
click node_heaps "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/11%20Heap"
click node_hashing "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/17%20Hashing%20Techniques"
click node_sorting "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/12%20Sorting%20Techniques"
click node_graphs "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/13%20Graphs"
click node_divideconquer "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/14%20Divide%20and%20Conquer"
click node_greedy "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/15%20Greedy%20Methods"
click node_dynamic "https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/16%20Dynamic%20Programming"

classDef toneNeutral fill:#f8fafc,stroke:#334155,stroke-width:1.5px,color:#0f172a
classDef toneBlue fill:#dbeafe,stroke:#2563eb,stroke-width:1.5px,color:#172554
classDef toneAmber fill:#fef3c7,stroke:#d97706,stroke-width:1.5px,color:#78350f
classDef toneMint fill:#dcfce7,stroke:#16a34a,stroke-width:1.5px,color:#14532d
classDef toneRose fill:#ffe4e6,stroke:#e11d48,stroke-width:1.5px,color:#881337
classDef toneIndigo fill:#e0e7ff,stroke:#4f46e5,stroke-width:1.5px,color:#312e81
classDef toneTeal fill:#ccfbf1,stroke:#0f766e,stroke-width:1.5px,color:#134e4a
class node_basics,node_recursion toneBlue
class node_arrays,node_strings,node_matrices,node_polynomials,node_linkedlists,node_stacks,node_queues,node_trees,node_heaps,node_hashing toneAmber
class node_sorting,node_graphs,node_divideconquer,node_greedy,node_dynamic toneMint
class node_learner,node_compiler,node_program toneIndigo
```

## Components

### Foundations

- [Programming Basics](https://github.com/jagratadeb/learndsa/tree/main/01%20Basic%20Concepts): `01 Basic Concepts`
- [Recursion](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/01%20Recursion): `02 Main Concepts/01 Recursion`

### Data Structures

- [Arrays and ADT](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/02%20Array%20Basics): `02 Main Concepts/02 Array Basics`
- [Strings](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/04%20Strings): `02 Main Concepts/04 Strings`
- [Matrices](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/05%20Matrix): `02 Main Concepts/05 Matrix`
- [Polynomials](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/06%20Polynomials): `02 Main Concepts/06 Polynomials`
- [Linked Lists](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/07%20Linked%20List): `02 Main Concepts/07 Linked List`
- [Stacks](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/08%20Stack): `02 Main Concepts/08 Stack`
- [Queues](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/09%20Queue): `02 Main Concepts/09 Queue`
- [Trees](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/10%20Trees): `02 Main Concepts/10 Trees`
- [Heaps](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/11%20Heap): `02 Main Concepts/11 Heap`
- [Hashing](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/17%20Hashing%20Techniques): `02 Main Concepts/17 Hashing Techniques`

### Algorithms

- [Sorting](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/12%20Sorting%20Techniques): `02 Main Concepts/12 Sorting Techniques`
- [Graph Traversal](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/13%20Graphs): `02 Main Concepts/13 Graphs`
- [Divide and Conquer](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/14%20Divide%20and%20Conquer): `02 Main Concepts/14 Divide and Conquer`
- [Greedy Methods](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/15%20Greedy%20Methods): `02 Main Concepts/15 Greedy Methods`
- [Dynamic Programming](https://github.com/jagratadeb/learndsa/tree/main/02%20Main%20Concepts/16%20Dynamic%20Programming): `02 Main Concepts/16 Dynamic Programming`

### Other components

- **Learner**
- **C/C++ Compiler**
- **Compiled Example**

## Connections

- Learner → Programming Basics: studies examples (evidence: `README.md`)
- Learner → Recursion: studies examples (evidence: `README.md`)
- Learner → Arrays and ADT: studies examples (evidence: `README.md`)
- Learner → Strings: studies examples (evidence: `README.md`)
- Learner → Matrices: studies examples (evidence: `README.md`)
- Learner → Polynomials: studies examples (evidence: `README.md`)
- Learner → Linked Lists: studies examples (evidence: `README.md`)
- Learner → Stacks: studies examples (evidence: `README.md`)
- Learner → Queues: studies examples (evidence: `README.md`)
- Learner → Trees: studies examples (evidence: `README.md`)
- Learner → Heaps: studies examples (evidence: `README.md`)
- Learner → Hashing: studies examples (evidence: `README.md`)
- Learner → Sorting: studies examples (evidence: `README.md`)
- Learner → Graph Traversal: studies examples (evidence: `README.md`)
- Learner → Divide and Conquer: studies examples (evidence: `README.md`)
- Learner → Greedy Methods: studies examples (evidence: `README.md`)
- Learner → Dynamic Programming: studies examples (evidence: `README.md`)
- Learner → C/C++ Compiler: compiles file (evidence: `README.md`)
- C/C++ Compiler → Compiled Example: produces executable (evidence: `README.md`)
