Publisher: Wikibooks 2010
The purpose of this wikibook is to show how common algorithms are written in various programming languages, providing code implementations and explanation. Topics: Checksums; Date and time; Geometry; Graphs; Hashing; Mathematics; Miscellaneous; Optimization; Pseudorandom Numbers; Search; Simulation; Sorting; String searching; Strings; etc.
Home page url
Download or read it online for free here:
by Thomas Niemann
Collection of algorithms for sorting and searching, and techniques for implementing dictionaries, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers.
Contents: Algorithm Complexity; Big-O Notation; Trees; Binary Search Trees; Graph; Dijkstra's Algorithm; A* Pathfinding; Dynamic Programming; Kruskal's Algorithm; Greedy Algorithms; Catalan Number; Sorting; Searching; Pascal's Triangle; etc.
by M. Crochemore, W. Rytter - Oxford University Press
This book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It will serve both as a textbook for courses on algorithm design and as a reference for professionals.
by Jason Brownlee - Lulu.com
This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete, consistent, and centralized manner.