- ECE home
- Undergraduate studies
- Douglas Wilhelm Harder
- Algorithms and data structures home
- Example algorithms and data structures
- Sorting algorithms
- Searching algorithms
- Backtracking
- Iterators
- Trees
- Three implementations of trees
- General trees
- 2-3 trees
- Skip lists
*d*-ary heaps- Bi-parental heaps
- Array resizing
- Sparse matrices
- Disjoint sets
- Maze generation
- N puzzles using A* searches
- Project scheduling
- The fast Fourier transform
- String distances
- Matrix-chain multiplications
- Inverse square root
- Newton polynomials
- Random trees
- Normal distributions
- Splay trees
- Skew heaps
- Binomial heaps
- Traveling salesman problem
- WEC programming competition 2014