About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 235. Chapters: Algorithm, Euclidean algorithm, Dijkstra's algorithm, Merge sort, Gaussian elimination, Insertion sort, Kruskal's algorithm, Heapsort, Subset sum problem, Relational model, Leap year, Lempel-Ziv-Welch, Bresenham's line algorithm, Extended Euclidean algorithm, Mandelbrot set, Pseudocode, Burrows-Wheeler transform, Bucket sort, Linear search, Flood fill, Algorithms for calculating variance, Sieve of Eratosthenes, Mersenne twister, SHA-1, Event-driven programming, MD5, Merge algorithm, Ford-Fulkerson algorithm, A* search algorithm, Depth-first search, Word problem for groups, Iteration, Pearson hashing, Memory leak, Comb sort, Cocktail sort, Alpha-beta pruning, State pattern, Cooley-Tukey FFT algorithm, Chord, Bellman-Ford algorithm, Schulze method, Recursion, Computation of CRC, Quicksort, Poisson distribution, Stack, Conjugate gradient method, SHA-2, Biconjugate gradient stabilized method, Jacobi eigenvalue algorithm, Duck typing, In-place matrix transposition, Frameworks supporting the polyhedral model, Static single assignment form, Conditional, Bitwise operation, Gauss-Seidel method, Kahan summation algorithm, Floyd-Warshall algorithm, Levenshtein distance, Bron-Kerbosch algorithm, Force-based algorithms, Tree traversal, Bubble sort, Division, Generalized minimal residual method, Proxmap sort, Topological sorting, RANSAC, Banker's algorithm, Dynamic array, Vincenty's formulae, Key stretching, Programming style, Needleman-Wunsch algorithm, Backpropagation, Pairwise summation, Graham scan, Karmarkar's algorithm, Jacobi method, Lamport's bakery algorithm, Closest pair of points problem, Successive over-relaxation, Multibrot set, Sieve of Atkin, DPLL algorithm, Hirschberg's algorithm, Data parallelism, Polytope model, Ordered dithering, Quiescence search, Xiaolin Wu's line algorithm, Strand sort, Cycle sort, Scalable...
