Comments:

69 pages, 1.2 Mb, 2008

Abstract:

This book is an overview of "the creation and analysis of efficient algorithms". Authors' statement quote: "After introducing some necessary mathematical background this book covers: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; and 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 an asteris may be skipped."

Rights:

Open access: "Copyright 2004--2006, Wikibooks contributors. This book is published by Wikibooks contributors. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License. All images are released under GFDL compatible licenses or released into the public domain. All rights reserved to their respective authors. Principal authors: Macneil Shonle (C); Matthew Wilson (C); Martin Krischik (C). Jyasskin (C),Gkhan " GNU License http://upload.wikimedia.org/wikipedia/commons/8/81/Algorithms.pdf

Links:

No messages.