Summary:
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. 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
Algorithms in C, Third Edition, Parts 1-4
and his new
Algorithms in C, Third Edition, Part 5, 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. 0201756080B07112001
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. 0201756080AB06262002
From the Back Cover
About the Author