Sedgewick R. - Algorithms in C, Parts 1-5 (Bundle)

Algorithms in C, Parts 1-5 (Bundle)

Sedgewick R.

ISBN: 9780201756081
Vydavateľstvo: Addison-Wesley
Rok vydania: 2001
Dostupnosť: Na objednávku

Pôvodná cena: 0,00 €
Cena: Na vyžiadanie

Nárok na dopravu zdarma
Pridať do wishlistu
Späť Tlačiť Pošli dopyt
Sedgewick's landmark works on computer algorithms -- thoroughly revised, and bundled at an exceptional price!
Today's most efficient algorithms for sorting, searching, graphing, and data structures.
New edition- completely rewritten- nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs!
Bridges the gap between theory and practice with carefully chosen examples, detailed figures, and complete implementations. Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C, Third Edition, Parts 1-4 and his new Algorithms in C, Third Edition, Part 5. Together, these books are definitive- the most up-to-date and practical algorithms resource available. Sedgewick masterfully blends theory and practice, making Bundle of Algorithms in C, Third Edition an essential resource for computer science researchers, students, and working developers alike. The first book introduces fundamental concepts associated with algorithms; then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Together, these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. In both books, Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents.
Robert Sedgewick is Professor of Computer Science at Princeton. He received his Ph.D. from Stanford University under Donald E. Knuth. Sedgewick is a Director of Adobe Systems, and has served on the research staffs of Xerox, PARC, the Institute for Defense Analysis, and INRIA. He is co-author of An Introduction to the Analysis of Algorithms.