Data Structures and Algorithm Analysis in Java

International Edition
3e édition

Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year... Lire la suite

Data Structures and Algorithm Analysis in Java is an advanced algorithms book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. It is also suitable for a first-year graduate course in algorithm analysis

 

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.

 

Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.


VitalSource eBook (VitalBook) - En anglais 55,00 € DRM

Spécifications


Éditeur
Pearson Education
Édition
3
Auteur
Mark Allen Weiss,
Langue
anglais
BISAC Subject Heading
COM051300 COMPUTERS / Programming / Algorithms
BIC subject category (UK)
UMB Algorithms & data structures
Code publique Onix
05 Enseignement supérieur
Date de première publication du titre
01 novembre 2013
Subject Scheme Identifier Code
Classification thématique Thema: Algorithmes et structures des données

VitalSource eBook


Date de publication
01 novembre 2013
ISBN-13
9781292014159
Ampleur
Nombre de pages de contenu principal : 640
Code interne
1292014156
Protection technique e-livre
DRM

Google Livres Aperçu


Publier un commentaire sur cet ouvrage

Avez-vous une question à nous poser ?