About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 243. Chapters: Combinatorial optimization, Convex hull algorithms, Exchange algorithms, Graph algorithms, Sorting algorithms, Dijkstra's algorithm, Merge sort, Gaussian elimination, Radix sort, Knapsack problem, Insertion sort, Travelling salesman problem, Kruskal's algorithm, Heapsort, Prim's algorithm, Shortest path problem, Nearest neighbour algorithm, Basis, Selection sort, Shell sort, Bucket sort, Pigeonhole sort, Greedy algorithm, Merge algorithm, Ford-Fulkerson algorithm, Knight's tour, Counting sort, Max-flow min-cut theorem, Minimax, A* search algorithm, Depth-first search, Bogosort, Smoothsort, Breadth-first search, Comb sort, Cocktail sort, Alpha-beta pruning, Assignment problem, Bellman-Ford algorithm, Simplex algorithm, Quicksort, Fisher-Yates shuffle, Graph isomorphism problem, Cycle detection, Oriented matroid, Criss-cross algorithm, Belief propagation, Cartesian tree, Nonblocking minimal spanning switch, Matching, Floyd-Warshall algorithm, Hopcroft-Karp algorithm, Gomory-Hu tree, Bron-Kerbosch algorithm, Cutting stock problem, Hungarian algorithm, Harmony search, Force-based algorithms, Tree traversal, Bees algorithm, Bubble sort, Color-coding, Edmonds's matching algorithm, Proxmap sort, Topological sorting, Maximum cut, FKT algorithm, Flow network, Barabasi-Albert model, Change of basis, Spreadsort, Edmonds-Karp algorithm, Pancake sorting, Greedoid, Clique percolation method, List of knapsack problems, Smallest circle problem, Graph embedding, Schwartzian transform, Planarity testing, Push-relabel maximum flow algorithm, Sorting network, Ellipsoid method, Robinson-Schensted-Knuth correspondence, Comparison sort, UnShuffle sort, Graph rewriting, Graham scan, External sorting, Subgraph isomorphism problem, D*, Robinson-Schensted algorithm, Inversion, Lexicographic breadth-first search, Closure problem, Suurballe's ...
