Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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 [...] learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
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 [...] learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
Über den Autor
Dr. Anany Levitin graduated from the Moscow State University with an MS degree in Mathematics. He holds a Ph.D. degree in Mathematics from the Hebrew University of Jerusalem and an MS degree in Computer Science from the University of Kentucky. Introduction to the Design and Analysis of Algorithms has been translated into Chinese, Russian, Greek, and Korean and is used in hundreds of schools all over the world. Dr. Levitin is also the author of Algorithmic Puzzles, publishing in Fall [...]. Levitin teaches courses in the Design and Analysis of Algorithms at Villanova University.
Inhaltsverzeichnis
  • 1 Introduction
  • 2 Fundamentals of the Analysis of Algorithm Efficiency
  • 3 Brute Force and Exhaustive Search
  • 4 Decrease-and-Conquer
  • 5 Divide-and-Conquer
  • 6 Transform-and-Conquer
  • 7 Space and Time Trade-Offs
  • 8 Dynamic Programming
  • 9 Greedy Technique
  • 10 Iterative Improvement
  • 11 Limitations of Algorithm Power
  • 12 Coping with the Limitations of Algorithm Power
Details
Erscheinungsjahr: 2019
Fachbereich: Arithmetik & Algebra
Genre: Importe, Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: 592 S.
ISBN-13: 9780273764113
ISBN-10: 027376411X
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Levitin, Anany
Auflage: 3. Auflage
Hersteller: Pearson Business
Pearson International
Pearson Education Limited
Verantwortliche Person für die EU: Pearson Studium im Verlag Pearson Benelux B.V. Zweigniederla, Sankt-Martin-Str. 82, D-81541 München, buchhandel@pearson.com
Maße: 235 x 195 x 32 mm
Von/Mit: Anany Levitin
Erscheinungsdatum: 05.09.2019
Gewicht: 1,112 kg
Artikel-ID: 106832849