Sorting and Searching Algorithms: A Cookbook
by Thomas Niemann
Number of pages: 36
This is a collection of algorithms for sorting and searching, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers. The text presents several sorting algorithms, techniques for implementing dictionaries, structures that allow efficient search, insert, and delete operations, algorithms that sort data and implement dictionaries for very large files.
Home page url
Download or read it online for free here:
by Jorg Arndt
Aimed to programmers who are interested in the selected algorithms and those who want to create optimized code. It covers low level algorithms, combinatorial generation, fast orthogonal transforms, fast arithmetic, and algorithms for finite fields.
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.
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 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.