Features
- Cover Type: Hard Cover with 657 pages
- Published by: Addison-Wesley Professional
- Edition: 1st Edition January 11, 1990
- Written in: English
- ISBN 10 Number: 0201514257
- ISBN 13 Number: 978-0201514254
-
Book Dimensions:
9.5 x 6.6 x 1.2 inches
- Weighs: 2.1 pounds
Product Review
Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures,
Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work.
Book Info
Covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Provides clear and relevant insight into why the algorithms work. Softcover.
--This text refers to the
Paperback
edition.
Reader Reviews
This review is from: Algorithms in C++ (Hardcover)
This is easily one of the leading texts on data structures and algorithms - a third edition has already been released (however, that is practically a new book ,so read on :-)...). Sedgewick is a student of the great Donald Knuth, and a leading researcher and authority in the field of Algorithmics. 'Pound for pound', this might be as good as Cormen et al's classic, which is the undisputed leader among introductory books on algorithms. However, this has two advantages over that book : (1)Size : Weighing in at a lean 656 pages, this is almost 40% smaller than Cormen's classic, while providing approximately the same breadth. However, Cormen has the edge in depth, especially rigorous analysis of algorithms' performance. (2)'Real' code : This book has code snippets in C++, as opposed to Cormen which has it in pseudocode.However, the code is far from 'ready to run' - it's just enough to give you an idea how to go about building your own code. Another plus point is short and crisp chapters which can be easily 'digested' - average chapter size is only about 14 pages. This book really covers a lot of topics - sorting, searching, parsing, computational geometry, graphs, fast fourier transforms, mathematical algorithms and much,much more. It is written in a very readable style, and the illustrations are a big help, perhaps the best in a book of this kind. It would've benefitted from a few more exercises, brief solutions, and a little more rigour in performance analysis. The code is excellent at one level, but it's actually excellent C code masquerading as C++ code, i believe. If you have no problem with C, you should perhaps go for the C version of this book - the C code is reminiscent of Kernighan & Ritchie. Beautiful, elegant C code !! If it's good C++ code that you're after, perhaps Mark Allen Weiss's book or Heileman's book might be a better choice. Also, the new (3rd) edition of this book has much better C++ code. If you want more depth and rigour, and are willing to work a little harder, then Cormen's the way to go. However, if you want a bit of everything in one compact book, then this is the best choice. (Sedgewick's come up with a recent revision, but it's spread over several volumes - not sure whether that's a better choice, however the C++ code seems much better in that, with C++ consultancy by Chris Van Wyk, another student of the great Don Knuth)
Comment | |
(Report this)
Search for books at
