Algorithms

contributors, Wikibooks

ISBN 10: 1466346310 / ISBN 13: 9781466346314

Edité par CreateSpace Independent Publishing Platform, 2011

A propos de cet article

Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Shows some signs of wear but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

N° de réf. du vendeur Z1-C-052-02312

Détails bibliographiques

• Titre: Algorithms
• Éditeur: CreateSpace Independent Publishing Platform
• Date de parution: 2011
• Langue: anglais
• ISBN à 10 chiffres: 1466346310
• ISBN à 13 chiffres: 9781466346314
• Reliure: Couverture souple
• État de l'article: Good

A propos de ce titre

Synopsis

This book is about the creation and analysis of efficient algorithms. After introducing some necessary matical 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 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]).