The purpose of this wikibook is to show how common algorithms are written in various programming languages, providing code implementations and explanation. Topics:

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.

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....

This is a book for the computationalist, whether 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.

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.

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,

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.

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.