Art of Programming Contest
by Ahmed Shamsul Arefin
Publisher: Gyankosh Prokashoni 2006
Number of pages: 247
This book is designed to serve as a textbook for an algorithm course focusing on programming as well as a programming course focusing on algorithms. The book is specially designed to train students to participate in competitions, especially the ACM International Collegiate Programming Contest.
Download or read it online for free here:
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 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.
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 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.