by M. Crochemore, W. Rytter
Publisher: Oxford University Press 1994
Number of pages: 412
This much-needed book on the design of algorithms and data structures for text processing emphasizes both theoretical foundations and practical applications. It is intended to serve both as a textbook for courses on algorithm design, especially those related to text processing, and as a reference for computer science professionals.
Home page url
Download or read it online for free here:
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.
This book shows how common algorithms are written in various programming languages, providing code implementations and explanation. Topics: Checksums; Date and time; Graphs; Hashing; Optimization; Search; Simulation; Sorting; String searching; etc.
by Joerg Arndt
This is a book for a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. We use the C++ programming language for low-level algorithms.
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.