Algorithms for Programmers: Ideas and Source Code
by Jorg Arndt
Number of pages: 220
This is a draft of a book about selected algorithms. The audience in mind are programmers who are interested in the treated algorithms and actually want to create and understand working and reasonably optimized code.
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 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.
by H. W. Lang - FH Flensburg
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. Explanations are followed by source code.