Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)

Sedgewick, Robert

ISBN 10: 0201756080 / ISBN 13: 9780201756081

Published by Addison-Wesley Professional, 2001

About this Item

This text aims to provide an introduction to graph algorithms and data structures and an understanding of the basic properties of a broad range of fundamental graph algorithms. It is suitable for anyone with some basic programming concepts. Num Pages: 1200 pages. BIC Classification: UMX. Category: (U) Tertiary Education (US: College). Dimension: 194 x 235 x 62. Weight in Grams: 2236. . 2001. 3rd Edition. paperback. . . . .

Seller Inventory # V9780201756081

Bibliographic Details

• Title: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)
• Publisher: Addison-Wesley Professional
• Publication Date: 2001
• Language: English
• ISBN 10: 0201756080
• ISBN 13: 9780201756081
• Binding: Soft cover
• Edition: 3rd Edition
• Condition: New

About this title

Synopsis

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.

About the Author

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