- Insertion Sort
- Selection Sort
- Bubble Sort
- Merge Sort
- Quick Sort
- Shell Sort
- Heap Sort
- Queue
- Stack
- Dequeue
- Priority Queue
- Indexed Priority Queue
- Disjoint Set (Union Find)
- Tree
- Binary Tree
- Binary Search Tree
- Immutable Set (based on binary search)
- Linear Search
- Binary Search
- Breadth First Search
- Depth First Search
- Kruskal's minimum spanning tree
- Prim's minimum spanning tree
- Boruvka's minimum spanning tree
- Dijkstra's shortest paths
- GCD / LCM
- Newton Method
- Binomial
- Gift wrapping (Jarvis)
- Graham Scan
- Quickhull
- Voronoi Diagram (Naïve implementation)
- Sierpinski triangle
- Knuth–Morris–Pratt (KMP)