This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated. Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence. An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into t (click here for further information)
More information on mogu pillows
Related posts:
2.0 out of 5 stars
As a student
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.
5.0 out of 5 stars
great book that covers a lot of ground
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.
2.0 out of 5 stars
Better as a Refresher Than a Stand-Alone Textbook
I am in the unfortunate situation of being in my first Algorithms class using this as our sole textbook.
5.0 out of 5 stars
Great Book
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…
5.0 out of 5 stars
One of the best textbooks I had so far
I took a course that utilized this book a year ago, and I was very impressed with the quality of both the text and the exercises.
3.0 out of 5 stars
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…
3.0 out of 5 stars
A reasonable textbook that needs much more…
I’m a studnet who’s currently taking this an algorithm class in UCB based on this textbook. I have to say that this book is not a bad algorithm book, but it’s really overly terse…
5.0 out of 5 stars
An excellent and small choice for a textbook in algorithms
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…
3.0 out of 5 stars
Supplemental Text Only
The top choice for an algorithms text is generally considered to be Cormen, et al. However, Cormen is not unassailable, and an author that is able to provide an alternate and…
5.0 out of 5 stars
Author’s student: By Far The Best Algorithms Book!
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.