Data Structures and Algorithm Analysis in C++

Mark Allen Weiss

584 pages, parution le 31/01/2006 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

Mark Allen Weiss' innovative approach to algorithms and data structures teaches the simultaneous development of sound analytical and programming skills for the advanced data structures course. Readers learn how to reduce time constraints and develop programs efficiently by analyzing the feasibility of an algorithm before it is coded.

The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. This Third Edition also features significantly revised coverage of lists, stacks, queues, and trees and an entire chapter dedicated to amortized analysis and advanced data structures such as the Fibonacci heap.

Known for its clear and friendly writing style, Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.

L'auteur - Mark Allen Weiss

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.

Sommaire

Introduction
Algorithm Analysis
Lists, Stacks, and Queues
Trees
Hashing
Priority Queues (Heaps)
Sorting
The Disjoint Set Class
Graph Algorithms
Algorithm Design Techniques
Amortized Analysis
Advanced Data Structures and Implementation

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Mark Allen Weiss
Parution	31/01/2006
Édition	3^eme édition
Nb. de pages	584
Format	19 x 23
Couverture	Broché
Poids	920g
Intérieur	Noir et Blanc
EAN13	9780321397331
ISBN13	978-0-321-39733-1