<< 1 >>
Rating: 
Summary: A good introduction text to algorithms
Review: I would not consider this book as the ultimate book for algorithms as the title suggests. :-) However, it is a very readable book, and filled with brief, but concise observations. Do not get me wrong. This book also has very detailed explanations of fundamental data structures and algorithms. Also, the best part of the book is that it lists good references for further readings. I loved this book. I would suggest this book to others. Math hints at the back of the books are useful, and some excercises are quite brain challenging. I think it is a great practice for students, but it is not so fun when students get it for assignments. :-)
Rating:
Summary: I like this book, it's done just right
Review: Not too encyclopedic (like Knuth or Cormen), yet not superficial or cursory (like Sedgewick). I think it because it's really new and so it's written right, just as the times require. Beautifully illustrated too, a lot of very nice, clean pictures. The reviewer below mentions Java, well he's missing the point a bit: yes there's a hunk of Java in many chapters, but ALL algorithms are VERY NICELY covered in pseudo-code (something missing in Knuth, for example). All in all, a great book, if you've got the money to spare (Wiley prices are as always high, but in this case--unlike in many other--it really doesn't feel terribly wrong ), don't even think of it, get it. [...]
Rating: 
Summary: Good Fundamentals
Review: There are many good books with this title or similar ones. This is probably one of the better ones for your bookshelf and for use in academia. The examples are written in Java (a current language) and they are easy to read. The presentation is clean and illustrative. The authors have a good track record for expertise and papers published, and you get the sense that it is more real-world than most similar books.
<< 1 >>
| 
