Paperback: 336 pages
Publisher: McGraw-Hill Education; 1 edition (September 13, 2006)
Product Dimensions: 7.1 x 0.5 x 9.6 inches
Shipping Weight: 1 pounds (View shipping rates and policies)
Average Customer Review: 3.8 out of 5 stars See all reviews (57 customer reviews)
Best Sellers Rank: #25,961 in Books (See Top 100 in Books) #8 in Books > Textbooks > Computer Science > Algorithms #13 in Books > Computers & Technology > Programming > Algorithms #104 in Books > Science & Math > Mathematics > Applied > Probability & Statistics
The entire book is available in PDF on Vazirani's website here: [...]The website says "draft" but it's the same or better (errata corrected) than the print version. (I accidentally bought the print version even though I knew about the PDF. At least I was able to resell it for [...])I used this book for CSE 101 Design and Analysis of Algorithms at UCSD. It's OK, but the level of detail of algorithms was too low for me to use just this book. I sometimes had to reference Wikipedia and other publications to achieve complete understanding.
As a professor in a state university, I learn, teach, and research on computer algorithms. Not many computer books are a joy to read, butthis one is exceptional: It is concise, informative, and inspiring.I don't know since when computer books are synonymous to boring, lengthypiles of printed papers filled with screen dumps. Truely innovativebooks are rare. Not only does this book explain algorithms clearly, it also tells the stories behind them.I would consider this book a good complement rather than a substitutionto Corman et al's book Introduction to Algorithms (which is one of themost widely used textbook for algorithm course). If you just want tofind a book where you can translate the suedo code into a program, thisis not for you. The focus of this book is to explain and to inspire (which is also what I believe the real "Education" should be) rather thandumping the students' head with codes and rules.I would also like to mention that the book "the design and analysis ofalgorithms" is also a good one. It is good for most colleges at undergraduate level except for a few "top-level" universities.
More concise than Introduction to Algorithms, certainly, but not better. I often feel that the explanations given in Algorithms are much harder to grasp than those in the CLRS book. Partly, this is due to fewer pages devoted to each concept, and fewer concepts overall (leading to a spottier understanding of the field and the relations between concepts.) However, this is also partly due to what I feel is a more confusing writing and teaching style by the authors of Algorithms.Algorithms was the assigned text in a class here at UC Berkeley, and I feel I would have been very confused if I did not have CLRS to cross-reference and explain things more clearly, and in more detail.This text isn't bad, per se, but there are definitely better options. I've taken the class with Christos Papadimitriou, and even he has said that everyone should own CLRS. Given that, I'm not sure what purpose this text serves. Is brevity actually better if you end up spending more time trying to understand things?
Algorithms is a complex topic in computing that needs tentative learning. The authors of this book really succeeded in making learning algorithms more enjoying, interesting, and easy yet comprehensive and advanced. This is a difficult equation, but this book really achieves it. It takes you from the early foundation with the Fibonacci algorithm till the complex graph algorithms while explaining each milestone all over the way. The was they present this subject is in a story manner or a casual discussion between two computing professionals which makes the book interactive, easy to access, and comprehensive. I recommend this book for both beginner and advanced readers in the field of computing.
A good text. Structured very nicely with lots of appropriate background that builds up the story and derivation of the algorithms. A bit too terse in places, leaving someone without a teacher hard-pressed to implement their efficient "selection" algorithm for medians or other percentiles into data sets, for instance. This situation happens a few critical times in the text. Although the coverage is good for the price and size of this volume, it really does lack in the amount of pseydocode listings as well. So, overall, good text on a budget and with a good professor, but kind of useless as a reference. Get the MIT press algorithms book if you need a reference text.
I occasionally teach algorithms at CU Boulder to our undergraduates. This book accomplishes what it set out to do: provide a comprehensible (but not comprehensive) treatment of a core piece of Computer Science at an affordable cost.That we get one of the greatest researchers in the area (Papadimitriou) alongside two other distinguished authors is just icing on the cake.The first printing had numerous errors, though the online version of the book had already corrected many of them. I haven't used the book since then, but will in the Fall, and I'd expect with the vigor already invested by the authors, the book will be in even better shape.I'm glad they wrote this thing.. it was long overdue.
This is one of the best introductory text on algorithms I've ever read. The concepts are presented clearly, the writing style is lucid, and whole book is very easy to follow. It emphasizes the ideas and insightful hints behind every algorithms, rather than the overly rigorous mathmatic proofs often found in other books. The book also includes a lot of exercises, as a complementary to the content. The side bars also provide a lot of interesting information.
Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms Applied Cryptography: Protocols, Algorithms, and Source Code in C [ APPLIED CRYPTOGRAPHY: PROTOCOLS, ALGORITHMS, AND SOURCE CODE IN C BY Schneier, Bruce ( Author ) Nov-01-1995 Practical Algorithms in Pediatric Hematology and Oncology: (Practical Algorithms in Pediatrics. Series Editor: Z. Hochberg) Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics) Principles of Robot Motion: Theory, Algorithms, and Implementations (Intelligent Robotics and Autonomous Agents series) Game Programming Algorithms and Techniques: A Platform-Agnostic Approach (Game Design) Principles of Digital Image Processing: Core Algorithms (Undergraduate Topics in Computer Science) Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery (The Morgan Kaufmann Series in Data Management Systems) Active Noise Control Systems: Algorithms and DSP Implementations (Wiley Series in Telecommunications and Signal Processing) Digital Signal Processing: Principles, Algorithms and Applications (3rd Edition) Communication System Design Using DSP Algorithms: With Laboratory Experiments for the TMS320C6701 and TMS320C6711 (Information Technology: Transmission, Processing and Storage) Digital Signal Processing: Principles, Algorithms and Applications C++ Algorithms for Digital Signal Processing (2nd Edition) C Algorithms for Real-Time DSP Communication System Design Using DSP Algorithms: With Laboratory Experiments for the TMS320C6713TM DSK (Information Technology: Transmission, Processing and Storage) Digital Media Processing: DSP Algorithms Using C Swift: Programming, Master's Handbook: A TRUE Beginner's Guide! Problem Solving, Code, Data Science, Data Structures & Algorithms (Code like a PRO in ... mining, software, software engineering,)