Toc

Table of Contents

1. Sorting
   1. Bubble sort
   2. Insertion sort
   3. Merge sort
   4. Heap sort
   5. Quicksort
   6. Introsort
2. Searching
   1. Breadth-First Search
   2. Depth-First Search
   3. Binary Search
   4. Exhaustive Search
   5. MetaHeuristic Search
   6. Parallel MetaHeuristic Search
3. Recursion
4. Graph Theory
   1. Shortest Path
   2. Graph Searching
   3. Minimum Spanning Tree
   4. Graph Connectivity
   5. Dijkstra's algorithm -- an efficient algorithm to a find the single shortest path between a given pair on a graph.
   6. Floyd-Warshall's Algorithm -- an efficient algorithm to find all-pairs shortest paths on a graph.
5. Dynamic Programming
   1. Longest Common Subsequence
6. Heuristic Algorithms
   1. Greedy
   2. Hill Climbing
   3. Simulated Annealing
   4. Evolution Algorithm
7. Computational Geometry
   1. Convex Hull
      1. QuickHull
      2. Graham's Scan
   2. Delaunay Triangulation
8. Number Theory
   1. Primes
      1. Prime List
      2. Sieve of Eratosthenes
   2. Repeated Squaring
   3. modular inverse
9. Linear Algebra
   1. Dimensions
   2. Vectors
   3. Objects, Surfaces, Planes
   4. Dot product and Cross product
   5. Transformations with matrices
   6. Rotations with matrices
   7. Rotations with quaternions
   8. Intersections
   9. Linear systems
      1. Direct matrix inversion
      2. Iterative matrix inversion
      3. Least squares approximation
   10. Eigensystems
       1. Direct methods
       2. Iterative methods
10. Data Structures
    1. Linked List
    2. Stack
    3. Queue
    4. Binary Search Tree
    5. Binary Heap -- used by Heap sort
    6. Hash Table
11. Procedural generation
12. Artificial Intelligence
    1. Genetic Algorithms
    2. Neural Networks