- 栈：数组实现(Stack:Array Implementation)
- 栈：链表实现(Stack:Linked List Implementation)
- 队列：数组实现(Queues:Array Implementation)
- 队列：链表实现(Queues:Linked List Implementation)
- 二分查找和线性搜索-有序列表(Binary and Linear Search-of sorted list)
- 二叉搜索树(BST)(Binary Search Trees)
- 平衡二叉搜索树(AVL)(Balanced Binary Search Trees)
- 红黑树(Red Black Trees)
- 伸展树(Splay Trees)
- 开放散列表-封闭寻址(Open Hash Tables-Closed Addressing)
- 封闭哈希表-开放寻址(Closed Hash Tables-Open Addressing)
- 封闭哈希表-哈希桶(Closed Hash Tables, using buckets)
- 字典树(Trie)/前缀树(Prefix Tree)
- 基数树(Radix Tree)
- 三叉搜索树(Ternary Search Tree) (Trie with BST of children)
- 多路搜索树(B树)(B Trees)
- 多路搜索树(B+树)(B+ Trees)
- 比较排序(Comparison Sorting)
- 冒泡排序(Bubble Sort)
- 选择排序(Selection Sort)
- 插入排序(Insertion Sort)
- 希尔排序(Shell Sort)
- 归并排序(Merge Sort)
- 快速排序(Quick Sort)
- 桶排序(Bucket Sort)
- 计数排序(Counting Sort)
- 基数排序(Radix Sort)
- 堆排序(Heap Sort)
- 广度优先搜索(Breadth-First Search)
- 深度优先搜索(Depth-First Search)
- 已连通分量(Connected Components)
- Dijkstra最短路径(Dijkstra's Shortest Path)
- Floyd最短路径(Floyd's Shortest Path)
- Prim最小生成树(Prim's Minimum Cost Spanning Tree)
- Kruskal最小生成树(Kruskal's Minimum Cost Spanning Tree)
- 拓扑排序-使用Indegree数组(Topological Sort-Using Indegree array)
- 拓扑排序-使用DFS(Topological Sort-Using DFS)
- 二维旋转和缩放矩阵(2D Rotation and Scale Matrices)
- 二维旋转和平移矩阵(2D Rotation and Translation Matrices)
- 二维坐标变换系统(2D Changing Coordinate Systems)
- 三维旋转和缩放矩阵(3D Rotation and Scale Matrices)
- 三维坐标变换系统(3D Changing Coordinate Systems)
