Sequential and Parallel Sorting Algorithms
by H. W. Lang
Publisher: FH Flensburg 2000
Sequential and parallel sorting algorithms explained, followed by source code. From the table of contents: insertion sort, quicksort, heapsort, mergesort, shellsort, lower bounds, external sorting, sorting networks, sorting on mesh-connected processor arrays, sorting contest.
Home page url
Download or read it online for free here:
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 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.
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 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.