Programming Books C Java PHP Python Learn more Browse Programming Books
Rented from RentU
To Rent, select Shipping State from options above
Due Date: May 31, 2015
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Qty:1
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
Sell yours for a Gift Card
We'll buy it for $18.32
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Algorithms Paperback – September 13, 2006

ISBN-13: 978-0073523408 ISBN-10: 0073523402 Edition: 1st

Buy New
Price: $46.19
Rent
Price: $32.17
27 New from $42.19 32 Used from $30.00
Rent from Amazon Price New from Used from
Kindle
"Please retry"
$18.95
Paperback
"Please retry"
$46.19
$42.19 $30.00
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Algorithms + Introduction to Algorithms, 3rd Edition + Algorithms (4th Edition)
Price for all three: $191.13

Buy the selected items together
NO_CONTENT_IN_FEATURE
Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Paperback: 336 pages
  • Publisher: McGraw-Hill Science/Engineering/Math; 1 edition (September 13, 2006)
  • Language: English
  • ISBN-10: 0073523402
  • ISBN-13: 978-0073523408
  • Product Dimensions: 7.3 x 0.5 x 9.2 inches
  • Shipping Weight: 1 pounds (View shipping rates and policies)
  • Average Customer Review: 3.9 out of 5 stars  See all reviews (48 customer reviews)
  • Amazon Best Sellers Rank: #64,881 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

This book explains all the algorithms in a very clear way.
Kourosh
Additionally, many problems in the exercises section don't have sufficient material covered in the chapter to tackle them without additional knowledge.
SpeedisaVirus
Overall the book is a joy to read and the exercises are fun.
Ram Sriharsha

Most Helpful Customer Reviews

53 of 55 people found the following review helpful By Kenyon Ralph on December 19, 2008
Format: Paperback Verified Purchase
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.
4 Comments Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
58 of 66 people found the following review helpful By T. Liu on March 13, 2007
Format: Paperback
As a professor in a state university, I learn, teach, and research on computer algorithms. Not many computer books are a joy to read, but

this one is exceptional: It is concise, informative, and inspiring.

I don't know since when computer books are synonymous to boring, lengthy

piles of printed papers filled with screen dumps. Truely innovative

books 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 substitution

to Corman et al's book Introduction to Algorithms (which is one of the

most widely used textbook for algorithm course). If you just want to

find a book where you can translate the suedo code into a program, this

is 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 than

dumping the students' head with codes and rules.

I would also like to mention that the book "the design and analysis of

algorithms" is also a good one. It is good for most colleges at undergraduate level except for a few "top-level" universities.
5 Comments Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
18 of 22 people found the following review helpful By John R. Black on March 4, 2008
Format: Paperback
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
11 of 13 people found the following review helpful By Charles Ashbacher HALL OF FAMETOP 500 REVIEWERVINE VOICE on September 9, 2008
Format: Paperback
One of the most appealing characteristics of this book is the small size. Textbooks in algorithms are similar to those of other fields in that they have continued to increase in girth over the years. At 320 pages, this book is a relative midget.
However, that does not in any way mean that it is weak in content, there is plenty of material for a one-semester course in algorithms. The chapters are:

*) Prologue - a bit of history and the big-O notation
*) Algorithms with numbers - basic and modular arithmetic, primality testing and cryptography
*) Divide-and-conquer algorithms - multiplication, recurrence relations, mergesort, matrix multiplication and the Fast Fourier Transform (FFT).
*) Decomposition of graphs - the fundamental definition of directed and undirected graphs and performing depth-first searches.
*) Paths in graphs- basic algorithms used in graph searches
*) Greedy algorithms - some fundamental greedy algorithms and their basic level of performance
*) Dynamic programming - shortest paths, knapsack optimization and independent sets in trees
*) Linear programming and reductions - the definition of linear programming and some of the standard problems that it can be used to solve
*) NP-complete problems - definition of NP-complete, some examples and reduction strategies used to show NP equivalence
*) Coping with NP-completeness - intelligent search, approximation and random algorithms
*) Quantum algorithms - a brief foray into a possible revolution in computing. Explanations of how data may be stored and processed at the quantum level.

The explanations are brief yet thorough enough for advanced computer science students, the algorithms are presented in a generic pseudocode.
Read more ›
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
20 of 25 people found the following review helpful By Z. SONG on October 14, 2006
Format: Paperback
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
11 of 13 people found the following review helpful By R. Park on February 6, 2008
Format: Paperback
As a CS undergrad at UC San Diego, the author used rough drafts of this book to teach the algorithms course I took as a student. Although we also used the Cormen("The Bible") Algorithms book for casual reference, this text is by far better to explain the concepts behind the algorithms. I must say that the author presents the course with this text far clearer and superior than the usual dry mathematicians and the contents of the material reflects his expertise in lecturing and writing. The lucid writing makes it a joy to actually read an algorithms book, and the exercises are definitely worth investigating. This book simply makes algorithms fun!
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Recent Customer Reviews


What Other Items Do Customers Buy After Viewing This Item?