How tadaoh/data-and-algo works
This repository is a small C++ collection of sorting algorithms, a permutation-printing program, and reusable data structures. A user supplies values to a sorting routine and receives the reordered vector; the permutation program reads n and prints permutations. The map and set provide ordered key-based containers backed by AVL trees, while pair provides a comparable two-value type. The tree lists modular map implementation files as well as an all-in-one version. The graph reflects documented capabilities and sampled interfaces; unsampled implementation details and uncertain wiring are omitted.
Main entry points: zzz_hh_map_avl.h Map Interface · permutation.cpp Permutation Program · zzz_hh_pair.h Pair Declaration · zzz_pair.h Pair Operations
Components 14
Algorithms
- Insertion Sort
algorithm/sort/insertion_sort.h - Heap Sort
algorithm/sort/heap_sort.h - Selection Sort
algorithm/sort/selection_sort.h - Permutation Program
algorithm/brute_force/permutation.cpp
AVL Containers
Pair Type
- Pair Declaration
data_structure/pair/zzz_hh_pair.h - Pair Operations
data_structure/pair/zzz_pair.h
Map Implementation
- Map Interface
data_structure/map_avl/zzz_hh_map_avl.h - Map Operations
data_structure/map_avl/zzz_map_avl_find_insert_erase.h - Map Iterators
data_structure/map_avl/zzz_map_avl_iterator.h - Reverse Iterators
data_structure/map_avl/zzz_map_avl_reverse_iterator.h
Other components
- User
- Console Output
Connections 12
- User → Insertion Sort: provides vector
- User → Heap Sort: provides vector
- User → Selection Sort: provides vector
- User → Permutation Program: enters n
- Permutation Program → Console Output: prints permutations
- User → AVL Map: uses container
- User → AVL Set: uses container
- User → Pair Declaration: uses type
- Pair Operations → Pair Declaration: defines operations
- Map Operations → Map Interface: implements operations
- Map Iterators → Map Interface: implements traversal
- Reverse Iterators → Map Interface: implements reverse traversal