Algorithms in C++ - Couverture souple

Sedgewick, Robert

Couverture souple

ISBN 10 : 0321606337 ISBN 13 : 9780321606334

Editeur : Addison-Wesley Educational Publishers Inc, 2009

A propos du livre

Quatrième de couverture

The latest addition to Robert Sedgewick's popular series of bookscarries his comprehensive collection of algorithms into anobject-oriented programming (OOP) environment with implementationin the C++ programming language. These algorithms cover a broadrange of fundamental and more advanced methods: sorting,searching, string-processing, geometric, graph, and mathematicalalgorithms. The algorithms are all expressed in terms of conciseimplementations in C++, so that readers can both appreciate theirbasic properties and test them on real applications.

The treatment of analysis of algorithsm is carefully developed. When appropriate, analytic results are discussed to illustratewhy certain algorithms are prefered, and in some cases, therelationship of the proactical algorithms being discussed topurely theoretical results is also described.

The ultimate aim of the book is to improve programming practice,whatever the environment, whatever the implementation language. Sedgweick describes the basic methods to be considered in everycase.

Features

• Hundreds of detailed, innovative figures clearly demonstratehow important algorithms work.
• Throughout the book, "properties" sections encapsulatespecific information on the performance characteristics ofalgorithms.
• Six chapters discuss fundamental concepts, including a briefintroduction to data structures.

Algorithms in C++ provides readers with the tools to implement,run, and debug useful algorithms with confidence. This book is ahelpful guide for users engaged in the transition to orexperimentation with OOP and/or the C++ language. It may be usedfor self study, or as a reference for developers or computersystems or applications programs.

Présentation de l'éditeur

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).

Détails de l'édition

• Éditeur: Addison-Wesley Educational Publishers Inc
• Date d'édition: 2009
• ISBN 10: 0321606337
• ISBN 13: 9780321606334
• Reliure: Broché
• Langue: anglais
• Nombre de pages: 672