Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching

Sedgewick, Robert

ISBN 10: 0201350882 / ISBN 13: 9780201350883

Edité par Addison-Wesley Professional, 1998

A propos de cet article

Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 2.63.

N° de réf. du vendeur G0201350882I5N00

Détails bibliographiques

• Titre: Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching
• Éditeur: Addison-Wesley Professional
• Date de parution: 1998
• Langue: anglais
• ISBN à 10 chiffres: 0201350882
• ISBN à 13 chiffres: 9780201350883
• Reliure: Paperback
• Édition: 3ème Édition
• État de l'article: Fair
• État de la jaquette: No Jacket

A propos de ce titre

Synopsis

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

À propos de l?auteur

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth. Christopher J. Van Wyk is Professor of Mathematics and Computer Science at Drew University. The author of Data Structures and C Programs (Addison-Wesley, 1988), he has served on the research staff at Bell Laboratories, where he is now a consultant. Robert Sedgewick and Christopher Van Wyk both earned their Ph.D. degrees from Stanford University under Donald E. Knuth. 0201350882AB06262002