Book on the study and analysis of Computer Algorithms.
More information
More information
Related categories 2
Sites 3
A downloadable textbook by Herbert S. Wilf. Each chapter is available as compressed PostScript or PDF.
By P. Crescenzi and V. Kann; KTH Stockholm. A continuously updated version of the appendix from the book "Complexity and Approximation" (Springer, 1999).
By Gaston H. Gonnet and Ricardo Baeza-Yates. The preface, table of contents, index and all source code of this handbook. The main goal is to make available through Internet the source code of many algorithms (in C and/or Pascal) that have been already tested.
A downloadable textbook by Herbert S. Wilf. Each chapter is available as compressed PostScript or PDF.
By Gaston H. Gonnet and Ricardo Baeza-Yates. The preface, table of contents, index and all source code of this handbook. The main goal is to make available through Internet the source code of many algorithms (in C and/or Pascal) that have been already tested.
By P. Crescenzi and V. Kann; KTH Stockholm. A continuously updated version of the appendix from the book "Complexity and Approximation" (Springer, 1999).
