Data Structures and Algorithm Analysis in C++ (3rd Edition)

Weiss, Mark Allen

ISBN 10: 0321375319 / ISBN 13: 9780321375315

Published by Addison Wesley, 2005

Item in good condition and has highlighting/writing on text. Used texts may not contain supplemental items such as CDs, info-trac etc. Seller Inventory # 00084576834

Synopsis:

In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. Class templates are used to describe generic data structures and first-class versions of vector and string classes are used. Included is an appendix on a Standard Template Library (STL). This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.

From the Back Cover:

Advanced Data Structures/Algorithms C++

 

Data Structures and Algorithm Analysis in C++, 3/e

Mark Allen Weiss, Florida International University

ISBN : 0-321-37531-9

 

Mark Allen Weiss teaches readers to reduce time constraints and develop programs efficiently by analyzing an algorithm’s feasibility before it is coded. His innovative approach to advanced algorithms and data structures simultaneously develops sound algorithm analysis and programming skills.

 

The Third Edition features a full C++ language update and incorporation of the Standard Template Library. There is new treatment of lists, stacks, queues, and trees, and an entire chapter dedicated to amortized analysis and advanced data structures such as the Fibonacci heap.

 

Highlights of the Third Edition

• All code has been updated and tested to ensure compliance with the ANSI/ISO C++ standards

 

• Standard Template Library fully incorporated throughout the text

 

• Completely revised coverage of lists, stacks, and queues in Chapter 3

 

• Readability enhanced by fresh interior design with new figures and examples

 

• End-of-chapter exercises, ranked by difficulty, reinforce key chapter concepts

 

 

Visit aw.com/computing for more information about Addison-Wesley computing books.

Bibliographic Details

Title: Data Structures and Algorithm Analysis in C+...
Publisher: Addison Wesley
Publication Date: 2005
Binding: Soft cover
Condition: Good
Edition: 3rd Edition