How jagratadeb/learndsa works
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 Programming Basics · 01 Recursion Recursion · 02 Array Basics Arrays and ADT · 04 Strings Strings
Components 20
Foundations
- Programming Basics
01 Basic Concepts - Recursion
02 Main Concepts/01 Recursion
Data Structures
- Arrays and ADT
02 Main Concepts/02 Array Basics - Strings
02 Main Concepts/04 Strings - Matrices
02 Main Concepts/05 Matrix - Polynomials
02 Main Concepts/06 Polynomials - Linked Lists
02 Main Concepts/07 Linked List - Stacks
02 Main Concepts/08 Stack - Queues
02 Main Concepts/09 Queue - Trees
02 Main Concepts/10 Trees - Heaps
02 Main Concepts/11 Heap - Hashing
02 Main Concepts/17 Hashing Techniques
Algorithms
- Sorting
02 Main Concepts/12 Sorting Techniques - Graph Traversal
02 Main Concepts/13 Graphs - Divide and Conquer
02 Main Concepts/14 Divide and Conquer - Greedy Methods
02 Main Concepts/15 Greedy Methods - Dynamic Programming
02 Main Concepts/16 Dynamic Programming
Other components
- Learner
- C/C++ Compiler
- Compiled Example
Connections 19
- Learner → Programming Basics: studies examples
README.md - Learner → Recursion: studies examples
README.md - Learner → Arrays and ADT: studies examples
README.md - Learner → Strings: studies examples
README.md - Learner → Matrices: studies examples
README.md - Learner → Polynomials: studies examples
README.md - Learner → Linked Lists: studies examples
README.md - Learner → Stacks: studies examples
README.md - Learner → Queues: studies examples
README.md - Learner → Trees: studies examples
README.md - Learner → Heaps: studies examples
README.md - Learner → Hashing: studies examples
README.md - Learner → Sorting: studies examples
README.md - Learner → Graph Traversal: studies examples
README.md - Learner → Divide and Conquer: studies examples
README.md - Learner → Greedy Methods: studies examples
README.md - Learner → Dynamic Programming: studies examples
README.md - Learner → C/C++ Compiler: compiles file
README.md - C/C++ Compiler → Compiled Example: produces executable
README.md