A PDF version is available.(info)

A printable version of Algorithms is available. (edit it)

This book requires that you first read Data Structures.

Contents

  [hide] 

• 1 Preamble
• 2 Table of Chapters
• 3 Why a Wikibook on Algorithms?
• 4 Further Reading
• 5 Sources
• 6 References
• 7 Contributors
• 8 External links

http://en.wikibooks.org/wiki/Algorithms

Preamble[edit]

This book aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the book we will introduce only the most basic techniques and describe the rigorous mathematical methods needed to analyze them.

The topics covered include:

• The divide and conquer technique.
• The use of randomization in algorithms.
• The general, but typically inefficient, backtracking technique.
• Dynamic programming as an efficient optimization for some backtracking algorithms.
• Greedy algorithms as an optimization of other kinds of backtracking algorithms.
• Hill-climbing techniques, including network flow.

The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth. This book is written so it can be read from "cover to cover" in the length of a semester, where sections marked with a * may be skipped.

This book is a tutorial on techniques and is not a reference. For references we highly recommend the tomes by [Knuth] and [CLRS]. Additionally, sometimes the best insights come from the primary sources themselves (e.g. [Hoare]).

Table of Chapters[edit]

Introduction  Mathematical Background  Divide and Conquer  Randomization  Backtracking  Dynamic Programming  Greedy Algorithms  Hill Climbing  Unweighted Graph Algorithms  Distance approximations Appendix A: Ada Implementation  There is also an all chapters view for printing.