<p/><br></br><p><b> Book Synopsis </b></p></br></br><p>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 <i>Algorithms in C, Third Edition, Parts 1-4</i> and his new <i>Algorithms in C, Third Edition, Part 5</i>. Together, these books are definitive: the most up-to-date and <i>practical</i> algorithms resource available. Sedgewick masterfully blends theory and practice, making <i>Bundle of Algorithms in C, Third Edition</i> 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. </p><p/><br></br><p><b> From the Back Cover </b></p></br></br><p> Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C. 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 <b>Algorithms in C, Third Edition, Parts 1-4</b> and his new <b>Algorithms in C, Third Edition, Part 5</b>, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. 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. 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. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs. </p> <p/> 0201756080B07112001<p/><br></br><p><b> About the Author </b></p></br></br><p></p> <b>Robert Sedgewick</b> 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.</p> <p/> 0201756080AB06262002 <p></p>
Cheapest price in the interval: 124.99 on October 22, 2021
Most expensive price in the interval: 124.99 on November 8, 2021
Price Archive shows prices from various stores, lets you see history and find the cheapest. There is no actual sale on the website. For all support, inquiry and suggestion messages communication@pricearchive.us