Toc

Table of Contents

 * 1) Sorting
 * 2) Bubble sort
 * 3) Insertion sort
 * 4) Merge sort
 * 5) Heap sort
 * 6) Quicksort
 * 7) Introsort
 * 8) Searching
 * 9) Breadth-First Search
 * 10) Depth-First Search
 * 11) Binary Search
 * 12) Exhaustive Search
 * 13) Recursion
 * 14) Graph Theory
 * 15) Shortest Path
 * 16) Graph Searching
 * 17) Minimum Spanning Tree
 * 18) Graph Connectivity
 * 19) Dijkstra's algorithm -- an efficient algorithm to a find the single shortest path between a given pair on a graph.
 * 20) Floyd-Warshall's Algorithm -- an efficient algorithm to find all-pairs shortest paths on a graph.
 * 21) Dynamic Programming
 * 22) Longest Common Subsequence
 * 23) Greedy
 * 24) Computational Geometry
 * 25) Convex Hull
 * 26) QuickHull
 * 27) Graham's Scan
 * 28) Delaunay Triangulation
 * 29) Number Theory
 * 30) Primes
 * 31) Prime List
 * 32) Sieve of Eratosthenes
 * 33) Repeated Squaring
 * 34) modular inverse
 * 35) Data Structures
 * 36) Linked List
 * 37) Stack
 * 38) Queue
 * 39) Binary Search Tree
 * 40) Binary Heap -- used by Heap sort
 * 41) Hash Table