Introduction to the Design and Analysis of Algorithms - Anany Levitin... - Librairie Eyrolles
Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Introduction to the Design and Analysis of Algorithms
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Introduction to the Design and Analysis of Algorithms

Introduction to the Design and Analysis of Algorithms

Anany Levitin - Collection International Edition

562 pages, parution le 16/03/2006 (2eme édition)

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 coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.

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.

Sommaire

  • Preface
  • Introduction
  • Fundamentals of the Analysis of Algorithm Efficiency
  • Brute Force
  • Divide-and-Conquer
  • Decrease-and-Conquer
  • Transform-and-Conquer
  • Space and Time Tradeoffs
  • Dynamic Programming
  • Greedy Technique
  • Iterative Improvement
  • 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
  • Bibliography
  • Hints to Exercises
  • Index
Voir tout
Replier

Caractéristiques techniques

  PAPIER
Éditeur(s) Pearson
Auteur(s) Anany Levitin
Collection International Edition
Parution 16/03/2006
Édition  2eme édition
Nb. de pages 562
Format 19 x 23,5
Couverture Broché
Poids 898g
Intérieur Noir et Blanc
EAN13 9780321364135
ISBN13 978-0-321-36413-5

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription