Publisher: Wikibooks 2010
The purpose of this wikibook is to show how common algorithms are written in various programming languages, providing code implementations and explanation. Topics: Checksums; Date and time; Geometry; Graphs; Hashing; Mathematics; Miscellaneous; Optimization; Pseudorandom Numbers; Search; Simulation; Sorting; String searching; Strings; etc.
Home page url
Download or read it online for free here:
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 Thomas Niemann
Collection of algorithms for sorting and searching, and techniques for implementing dictionaries, with brief and intuitive descriptions. It is assumed that you know C, and that you are familiar with concepts such as arrays and pointers.
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.
by Ahmed Shamsul Arefin - Gyankosh Prokashoni
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 - the ACM International Collegiate Programming Contest.