How krahets/hello-algo works
Hello Algo is an open, beginner-oriented data-structures-and-algorithms tutorial, with animated explanations and runnable examples in multiple languages. The principal learning workflow is for a reader to study a topic, run its example, and inspect the demonstrated result. The tree supports the breadth of the code examples; the README describes the visual and written tutorial, but those assets are not represented in the supplied tree. The sampled tree examples show implementations and printed demonstrations; other topic links reflect the chapter organization, not inspected call relationships.
Main entry points: codes Multilanguage Examples · binary_search_tree.cpp BST Demonstration · chapter_computational_complexity Complexity · chapter_array_and_linkedlist Arrays & Lists
Components 17
Foundations
- Complexity
codes/cpp/chapter_computational_complexity
Data Structures
- Arrays & Lists
codes/cpp/chapter_array_and_linkedlist - Stacks & Queues
codes/cpp/chapter_stack_and_queue - Trees
codes/cpp/chapter_tree - Hashing
codes/cpp/chapter_hashing - Heaps
codes/cpp/chapter_heap
Algorithms
- Searching
codes/cpp/chapter_searching - Sorting
codes/cpp/chapter_sorting - Graph Algorithms
codes/cpp/chapter_graph - Divide & Conquer
codes/cpp/chapter_divide_and_conquer - Dynamic Programming
codes/cpp/chapter_dynamic_programming - Backtracking
codes/cpp/chapter_backtracking - Greedy Algorithms
codes/cpp/chapter_greedy
Runnable Examples
- Multilanguage Examples
codes - BST Demonstration
codes/cpp/chapter_tree/binary_search_tree.cpp - Tree Utilities
codes/cpp/utils/common.hpp
Other components
- Reader
Connections 15
- Reader → Multilanguage Examples: studies and runs
- Multilanguage Examples → Complexity: includes topics
- Multilanguage Examples → Arrays & Lists: includes topics
- Multilanguage Examples → Stacks & Queues: includes topics
- Multilanguage Examples → Trees: includes topics
- Multilanguage Examples → Hashing: includes topics
- Multilanguage Examples → Heaps: includes topics
- Multilanguage Examples → Searching: includes topics
- Multilanguage Examples → Sorting: includes topics
- Multilanguage Examples → Graph Algorithms: includes topics
- Multilanguage Examples → Divide & Conquer: includes topics
- Multilanguage Examples → Dynamic Programming: includes topics
- Multilanguage Examples → Backtracking: includes topics
- Multilanguage Examples → Greedy Algorithms: includes topics
- BST Demonstration → Tree Utilities: uses tree helpers