- Quick-Find
- Quick-Union (weighting, path compression)
- With Array
- With LinkedList
- Shell Sort (with Insertion Sort)
- Merge Sort
- Quick Sort
- Priority Queue (with Heap)
- Heap Sort
- Binary Search Tree
- Red-Black Tree
- B-Tree
- K-D Tree
- LinearProbing
- SeparateChaining
- Undirected-Graph
- Digraph
- DFS, BFS
- Connected Component, Strong Connected Component
- DAG, Topological Sort
- LSD(Least-Significant-digit-first)
- MSD(Most-Significant-digit-first)
- 3-way String Quick Sort