- Paperback: 1200 pages
- Publisher: Addison-Wesley Professional; 3rd Revised edition edition (Sep 10 2001)
- Language: English
- ISBN-10: 0201756080
- ISBN-13: 978-0201756081
- Product Dimensions: 23.3 x 19.6 x 4.4 cm
- Shipping Weight: 1.9 Kg
- Average Customer Review: 5.0 out of 5 stars See all reviews (2 customer reviews)
-
Amazon Bestsellers Rank:
#612,190 in Books (See Top 100 in Books)
- #11 in Books > Computers & Internet > Programming > C > Algorithms
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
Product Details |
Product Description
Book Description
Sedgewicks landmark works on computer algorithms -- thoroughly revised, and bundled at an exceptional price!
Todays 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 Sedgewicks landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating todays 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.
Todays 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 Sedgewicks landmark texts on algorithms. Sedgewick has completely revamped all five sections, illuminating todays 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.
From the Back Cover
Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewicks landmark texts on algorithms for C. Sedgewick has completely revamped all five sections, illuminating todays 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
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most helpful customer reviews
5.0 out of 5 stars
The best book for beginners,
By "sidhantdash" (India) - See all my reviews
This review is from: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback)
Sedgewick's 'Algorithms in C' is undeniably the best book for beginners studying about algorithms and data structures. The text is clear, lucid, and the programming examples are very well documented. The exercises and problems stimulate thoughts and help in developing a better understanding of the subject. All the key aspects of the subject are sufficiently addressed, and discussed in the best possible way. It's the code in the book that I love the most, it can be compiled on almost any compiler without almost any change being made to it. I would strongly recommend this book as a textbook to all beginners embarking on a study of data structures and algorithms.
5.0 out of 5 stars
Lucid thought process - excellent coverage & examples,
By A Customer
This review is from: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback)
I have quite a few books on algorithms and C programming, and this probably takes the cake. Sedgewick writes clearer than perhaps anyone on the subject. The book is filled to the gills with tiny 20 line (complete) programs that do amazing things - such as the program to compute all the prime numbers less than N (provided as input). These examples are typically given to illustrate some point (such as using dynamic array allocation for storing which numbers are prime) - but the short, concise algorithms given in the examples are learning aids as well (i.e. - I didn't know you could calculate a list of primes so easily, and I can probably take this knowledge and use it somewhere else). The reader is challenged to alter the examples (instead of using an array to store which numbers are prime, use a bitmap). Because the examples are small, compact, and easy to read, this provokes one to actually sit down and try and play with them. In contrast, I also have the Algorithms In C O'Reilley book by Kyle Loudon and after reading the Sedgewick title, I'm throwing that away. That book spends 1/3 of the chapter describing the algorithms, and then spends the rest of it in user-interface code examples. Of course, all the user interfaces for all the examples in the book are pretty much the same, so the whole book is filled with redundant useless code. More analysis, less filler, please. As Sedgewick was a student of Knuth, I consider his books as the practical guide to Knuth's tomes (which seem out of date - do we really need algorithm analysis on external storage these days??), which are filled with rigorous mathematical analysis. I highly recommend this book(s) -- actually there are two, with the second volume covering graphs. I wish my University had used these texts in programming / algorithm analysis courses. I really don't have any negative commentary -- other than the nitpick that his coding style is very compact and skeletal --> main(){ for(...) do_something;} However, since the examples are so small, it hardly matters.
Share your thoughts with other customers: Create your own review
Most Helpful Customer Reviews on Amazon.com (beta) Amazon.com:
4.3 out of 5 stars (6 customer reviews) 32 of 34 people found the following review helpful
5.0 out of 5 stars
Lucid thought process - excellent coverage & examples,
By A Customer - Published on Amazon.com
This review is from: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback)
I have quite a few books on algorithms and C programming, and this probably takes the cake. Sedgewick writes clearer than perhaps anyone on the subject. The book is filled to the gills with tiny 20 line (complete) programs that do amazing things - such as the program to compute all the prime numbers less than N (provided as input). These examples are typically given to illustrate some point (such as using dynamic array allocation for storing which numbers are prime) - but the short, concise algorithms given in the examples are learning aids as well (i.e. - I didn't know you could calculate a list of primes so easily, and I can probably take this knowledge and use it somewhere else). The reader is challenged to alter the examples (instead of using an array to store which numbers are prime, use a bitmap). Because the examples are small, compact, and easy to read, this provokes one to actually sit down and try and play with them. In contrast, I also have the Algorithms In C O'Reilley book by Kyle Loudon and after reading the Sedgewick title, I'm throwing that away. That book spends 1/3 of the chapter describing the algorithms, and then spends the rest of it in user-interface code examples. Of course, all the user interfaces for all the examples in the book are pretty much the same, so the whole book is filled with redundant useless code. More analysis, less filler, please. As Sedgewick was a student of Knuth, I consider his books as the practical guide to Knuth's tomes (which seem out of date - do we really need algorithm analysis on external storage these days??), which are filled with rigorous mathematical analysis. I highly recommend this book(s) -- actually there are two, with the second volume covering graphs. I wish my University had used these texts in programming / algorithm analysis courses. I really don't have any negative commentary -- other than the nitpick that his coding style is very compact and skeletal --> main(){ for(...) do_something;} However, since the examples are so small, it hardly matters.
13 of 14 people found the following review helpful
5.0 out of 5 stars
The best book for beginners,
By "sidhantdash" - Published on Amazon.com
This review is from: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback)
Sedgewick's 'Algorithms in C' is undeniably the best book for beginners studying about algorithms and data structures. The text is clear, lucid, and the programming examples are very well documented. The exercises and problems stimulate thoughts and help in developing a better understanding of the subject. All the key aspects of the subject are sufficiently addressed, and discussed in the best possible way. It's the code in the book that I love the most, it can be compiled on almost any compiler without almost any change being made to it. I would strongly recommend this book as a textbook to all beginners embarking on a study of data structures and algorithms.
3 of 4 people found the following review helpful
5.0 out of 5 stars
Excellent reference books on C algorithms,
By Robert A. Dahlberg "Bob Dahlberg" - Published on Amazon.com
This review is from: Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (Paperback)
The second text (Part 5 - graph algorithms) was a real suprise. I bought the set for the first book, because I couldn't find the first text by it self. To my suprise, Part 5 was excellent and help me solve an issue I've been dealing with for weeks. The books not only give good analysis of the algorithms, but also provide sample source code.Sedgewick's books are now an essential part of my C programming reference library. I've referred to his books many times since I bought them. Unlike most technical references, these books are excellent, even if you aren't interested in C. Excellent texts. |
|
Listmania!
Look for similar items by category
- Books > Computers & Internet > Computer Science > Software Engineering > Information Systems
- Books > Computers & Internet > Computer Science > Systems Analysis & Design
- Books > Computers & Internet > Microsoft > Development > C & C++ Windows Programming
- Books > Computers & Internet > Programming > Algorithms
- Books > Computers & Internet > Programming > C > Algorithms
- Books > Computers & Internet > Programming > Languages & Tools
- Books > Computers & Internet > Software
- Books > New & Used Textbooks > Computer Science & Information Systems > Algorithms
- Books > New & Used Textbooks > Computer Science & Information Systems > Computer Science
- Books > New & Used Textbooks > Computer Science & Information Systems > Programming Languages
- Books > Qualifying Textbooks - Fall 2007 > Computers & Internet
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
|
