|
|
|
Detail Center Header Text Above Items |
(Larger Image)
|
Computer Algorithms
by Ellis Horowitz, Sanguthevar Rajasekaran
Product Group: Book
Publisher: W. H. Freeman (1997-08-15)
ISBN: 0716783169
EAN: 9780716783169
Dewy Decimal #: 005.133
Hardcover: 7 pages
SKU: T070828-6059
Condition: Very Good
Comments: Very good overall condition. Very tight binding. Some highlights. No dust cover. Ships same day or next in a bubble mailer. Enjoy.
|
Customer Reviews
|
Good for some purposes
Rating  (4)
Date: 2006-11-27
1 out of 1 customers found this reveiw helpful
There are essentially three reasons one might want a book on algorithms: (a) to learn how to design algorithms; (b) to learn how to analyze algorithms; and (c) as a reference for algorithms that are already known. This is a decent book for the first purpose, and a poor choice for the remaining two. Organizationally, it is structured around general techniques for algorithm design, which means that techniques of analysis and algorithms for solving specific problems are scattered widely and difficult to find or link together into a logical sequence.
I also find myself sympathetic with other reviewers who complain about the difficulty in understanding the book. The problem is not that the information is difficult, but that the authors often do not approach it seriously. It's easy to tell that they are interested in the general techniques, and that they considered it a chore to explain the mathematics behind analysis. As a result, the mathematical side of the book is not particularly inspired.
That said, though, this is the ONLY book I'm aware of that teaches with this particular organization. If your goal is to create new algorithms for solving problems (particularly combinatorial problems), then this is probably worth a read even if you have to refer elsewhere to fill in some details.
|
|
No online corrections/list of errors?
Rating  (2)
Date: 2006-01-23
1 out of 1 customers found this reveiw helpful
One of the first examples in the book, priming you to analyze the time complexity of random algorithms, goes on to conclude that the probability of rolling 2 6-sided dice whose faces add to ten is 9/36, or 1/4.
Of course, that doesn't make sense and all the examples are bad at explaining how they come to conclusions. Since I can't find any online corrections of errors in the book, I'm already lost, not knowing if I just don't understand or if they just got it wrong.
It would also have been nice if they put in the fairly standard "solutions to every other problem" in the back of the book, or at least offered (at an extra cost, of course) a solution guide.
|
|
useless book
Rating  (1)
Date: 2004-09-18
2 out of 4 customers found this reveiw helpful
i dont understand why authors like horowitz and rajasekharan,write books which they can only read themselves that too under extreme trauma.
i know it may sound harsh, but all the students i have interacted absolutely hate this book,with good reasons too.
too obcure langauge,little explanation of algorithm.
if u read this book u will develop a hatred for algorithms.which is not good at all.
|
|
A very good book!
Rating  (5)
Date: 2003-09-18
1 out of 2 customers found this reveiw helpful
I dont know why this books has such negative reviews. Its one of the only algo books that covers so many topics in detail.
In most Indian universities, "Introduction To algorithms" By Comer(MIT press) is the standard book for undergrad and Knuths book is used for Grad. But the Comer book is too theoretical. It does not tell you how to think. The Horowitz/Sahni book gives you an idea of how to think intuitively. To see what I mean, read "Greedy algorithms" chapter from both the books and you will start loving Horowitz/Sahni book. My advice is that first understand the concepts from Horowitz/Sahni - it will also cover most maths. Then read Comer. And dont skip the problems
in Comer.
|
|
A unique textbook
Rating (4)
Date: 2003-03-12
1 out of 2 customers found this reveiw helpful
The most interesting fact about this book is that, as far as I know, it is the only one to provide general guidelines and explicit strategies for algorithm design. It covers most of the known techniques for exhaustive and heuristic traversals of decision trees and should provide an invaluable background to all those that have to solve new problems. More than an introduction to algorithms, it develops a true methodology.
|
|
|
|
Detail Center Footer Text Below Items |
|
|