Data Structures and Algorithm Analysis in C++ - Softcover

Mark, Weiss

Softcover

ISBN 10: 0321375319 ISBN 13: 9780321375315

Verlag: Addison Wesley, 2006

Inhaltsangabe

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.

Über diesen Titel

Reseña del editor

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.

Details zur Ausgabe

• Verlag: Addison Wesley
• Erscheinungsdatum: 2006
• Sprache: Englisch
• ISBN 10: 0321375319
• ISBN 13: 9780321375315
• Einband: Tapa blanda
• Anzahl der Seiten: 608
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Riccardo Bacigalupo; riccardo.bacigalupo@sanoma.it; ; Sanoma Italia Via Arconati, 1 �; Milano; 20135; Italien