Available from 10 stores - Select your deal and buy the Algorithms (1st Edition)
"Where can I buy a Algorithms (1st Edition)?" At all of these merchants listed below. Click any of the deals below to buy now on the merchant's website.
No APO/FPO addresses please. Choose Expedited shipping for fastest delivery! Expedited shipping 2-6 business days; Standard shipping 7-10 business days from the date of shipment with Trackable method.
Absolutely Brand New & In Stock. 100% 30-Day Money Back. Direct from our warehouse. Ships by USPS. 1+ million customers served-In business since 1986. Happy Customers is Our #1 Goal. Toll Free Support
Find other products that have similar tags to the Algorithms (1st Edition)
computer Languages Textbooks Books databases Linear programming Computer Books: Languages Computer algorithms Databases & data structures quantum mechanics vector spaces text mathematical 1st Data structures Algorithm 1st Edition uc classical physics one time pad one-time pad one-semester course algorithms course Quantum algorithms
Latest 6 Reviews Here is what people are saying about the Algorithms (1st Edition)
"Algorithms"
2009-10-12
- Reviewed By User: A3JRT8B0RGMBVW
I purchased this book for a college course. It came in plenty of time for school.
I will always buy school books first from amazon. I will not pay full price for a
book that is almost in perfect condition. Amazon is a great way to buy books.
"As a student"
2009-06-10
- Reviewed By User: A1XAUA3SHZ50JI
I took this class as a student and I was not impressed at all by the text. The text is far too informal. The problems unchallenging. The algorithms uninteresting. The historical content was far too sparse. If you are going to have history, have enough that it satisfies or have none at all. I would recommend "How to Think About Algorithms" by Jeff Edmonds over this book any day.
This is one of the best algorithms books out there. What I like about it is the breadth of the topics discussed. I wouldn't suggest it as a starters book by its own though. Many of the topics it discusses have introductory books of their own with more details, such as graph theory/algorithms, numerical algorithms, linear programming, randomized algorithms, quantum algorithms, theory of computation, etc. What amazes me about this book is how it puts all these things into perspective. I had great fun reading this book, even though I have studied most of these individual areas before. The book does not delve into rigorous proofs, but rather gives the crux of the proof in most of the cases. This, in my opinion, is one of the great virtues of the book.
The typical CS student enters the world of algorithms via data structures, search and sort, shortest paths, graph algorithms, etc. Some students end up with a very limited view of the field. I strongly believe that a CS graduate should be familiar with all the topics discussed in this book, may be with the exception of the chapter on quantum computing. I really like the subject of the first few chapters which lead to the RSA algorithm. The book tells you from the start that this is not your traditional algorithms book.
"Better as a Refresher Than a Stand-Alone Textbook"
2009-03-03
- Reviewed By User: AN6NT16VXXJZS
I am in the unfortunate situation of being in my first Algorithms class using this as our sole textbook. While this textbook does gloss over the subjects I need to know, for each chapter in the book only the most basic of examples are given, and each chapter makes constant references to chapters and pages well before it, so much flipping back and forth is done to grasp a concept (to understand what we're doing in 3.4, please look at the diagram in 2.3, for example). And while the chapters cover the very basics of a concept, the problems at the end of each chapter often start right off with questions not even remotely covered in the chapter, taking stuff to a level I can't even begin to grasp as of yet.
The only reason I didn't give this book 1 star is because I think this book might be good for a refresher of Algorithms for someone who'd already learned them and needed to brush up. For that alone, I might consider keeping this book at the end of the semester. This seriously strikes me as one of those textbooks written by the grad students and barely glanced at by the professors credited with it. Seems to be a reoccurring theme in my academic life.
"Great Book"
2009-02-21
- Reviewed By User: AVLYQ94RWRPG9
A very well written book. I used it for an undergraduate algorithms course I attended. It covers a big range of subjects(which i list since I see no preview possibility provided):
- algorithms for numbers - divide & conquer - algorithms for graphs - greedy algorithms - dynamic programming - linear programming - reductions - NP completeness - quantum algorithms
A big plus: the writers really try to give the intuition behind the proofs I definetely recommend it!
"Available online for free; lacks some details and explanation"
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.
Last updated: Nov 22, 2009 at 09:05 EST. Pricing information is provided by the listed merchants. GoSale.com is not responsible for the accuracy of pricing information, product information or the images provided. Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on amazon.com or other merchants at the time of purchase will apply to the purchase of this product. As always, be sure to visit the merchant's site to review and verify product information, price, and shipping costs. GoSale.com is not responsible for the content and opinions contained in customer submitted reviews.
Expedited Available
"Algorithms"
"As a student"
"Available online for free; lacks some details and explanation"