Introduction to the Design and Analysis of Algorithms

Anany Levitin

522 pages, parution le 26/02/2003

Ajouter à une liste

Indisponible

Résumé

Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a truly innovative manner.

KEY TOPICS: Written in a reader-friendly style, the book encourages broad problem-solving skills while thoroughly covering the material required for introductory algorithms. The author emphasizes conceptual understanding before the introduction of the formal treatment of each technique. Popular puzzles are used to motivate readers' interest and strengthen their skills in algorithmic problem solving. Other enhancement features include chapter summaries, hints to the exercises, and a solution manual.

MARKET: For those interested in learning more about algorithms.

Contents

Introduction
Fundamentals of Analysis of Algorithms Efficiency
Brute-Force
Divide-and-Conquer
Decrease-and-Conquer
Transform-and-Conquer
Space and Time Tradeoff
Dynamic Programming
Greedy Approach
Limitations of Algorithm Power
Coping with the Limitations of Algorithm Power.
Epilogue

Appendix A: Useful Formulas for the Analysis of Algorithms
Appendix B: Short tutorial on Recurrence Relations

L'auteur - Anany Levitin

Professor of Computing Sciences at Villanova University. His highly regarded article "A New Road Map of Algorithm Design Techniques: Picking Up Where the Traditional Classification Leaves Off" was published in the April, 2000 issue of Dr. Dobb's Journal. He has given several talks on teaching algorithms at SIGCSE conferences, including "Using Puzzles in Teaching Algorithms" at the SIGCSE 2002.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Anany Levitin
Parution	26/02/2003
Nb. de pages	522
Format	19,2 x 23,6
Couverture	Relié
Poids	1001g
Intérieur	Noir et Blanc
EAN13	9780201743951
ISBN13	978-0-201-74395-1