Introduction To The Design And Analysis Of Algorithms

Anany Levitin

ISBN 10: 027376411X / ISBN 13: 9780273764113

Edité par Pearson Education, 2011

A propos de cet article

Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide.

N° de réf. du vendeur ABNR-4311

Détails bibliographiques

• Titre: Introduction To The Design And Analysis Of Algorithms
• Éditeur: Pearson Education
• Date de parution: 2011
• Langue: anglais
• ISBN à 10 chiffres: 027376411X
• ISBN à 13 chiffres: 9780273764113
• Reliure: Couverture souple
• Édition: Edition internationale
• État de l'article: New

A propos de ce titre

Synopsis

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 emphasises 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.

Présentation de l'éditeur

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.