<< 1 >>
Rating: 
Summary: A very good book!
Review: 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.
Rating: 
Summary: useless book
Review: 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.
Rating:
Summary: The worst textbook in computer science. Don't buy it!!
Review: The heading says it all; this is a very comprehensive text, and well organized topic-wise, with good logical flow. But it gives a feeling of having been written in a hurry. Although not totally dry, it does not make for a motivational textbook. Examples are often left unexplained, when even a few lines of explanation would make it clear what's going on.DO BUY this book if: 1. You're taking a course in algorithms, have a good professor, and you need sufficient material in one source. 2. You enjoy challenges in which the material HAS been COMPLETELY presented logically but you need to figure out what's going on. 3. You can tolerate poor pedagogical methods as long as all the material is there in one place. DO NOT BUY this book if: 1. You have not had much exposure to the subject, and you need a self-study kind of book. 2. You do not have a motivational professor. 3. You need a textbook to be "engaging".
Rating: 
Summary: A unique textbook
Review: 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.
Rating:
Summary: Not bad.
Review: To be fair, this book is not bad. Compared to the usually 1000+ pp. algorithms book, this one is neat and succint. It offers a cleay structure demostrating the materials, focusing on the overall designing method. After the basic introduction and data structres, each one of the following chapters, namely titled as Divide-&-Conquer, Greedy, Dynamic, Search-Traversal, Backtracking, occupies one chapter in its own. These five chapters are the core part of the book. After that, the authors turns to some deeper topics (FFT, NP, etc) and closing the book on the Pram, Mesh, Hypecube algorithm. This approach is different from the ordinary algorithm book. I must say that the organization of the materials is very succint. It is at the same time the merit and the drawback. Indeed sometimes it is too succint to comprehend. The materials usually under the same chapter scatter among the chapters. for example, the various sorting algorithm. Readers should read the whole book to learn these technic. Even the exercise lacks the easier ones to convince the students in learning. (regardless the exercises of the first section (to look up a dictionary for the meaning of "algorithm", et al. ) The FIRST EXERCISE of the whole book is to DESIGN AN ALGORITHM ABOUT HORNER's RULE AND ANAYLYZE IT. It's gone too far and incredible. (No wonder some students dislike the book...) BTW, I find myself appreciating the decent typeset and the pseudocode system used in this book.
Rating:
Summary: Not bad.
Review: To be fair, this book is not bad. Compared to the usually 1000+ pp. algorithms book, this one is neat and succint. It offers a cleay structure demostrating the materials, focusing on the overall designing method. After the basic introduction and data structres, each one of the following chapters, namely titled as Divide-&-Conquer, Greedy, Dynamic, Search-Traversal, Backtracking, occupies one chapter in its own. These five chapters are the core part of the book. After that, the authors turns to some deeper topics (FFT, NP, etc) and closing the book on the Pram, Mesh, Hypecube algorithm. This approach is different from the ordinary algorithm book. I must say that the organization of the materials is very succint. It is at the same time the merit and the drawback. Indeed sometimes it is too succint to comprehend. The materials usually under the same chapter scatter among the chapters. for example, the various sorting algorithm. Readers should read the whole book to learn these technic. Even the exercise lacks the easier ones to convince the students in learning. (regardless the exercises of the first section (to look up a dictionary for the meaning of "algorithm", et al. ) The FIRST EXERCISE of the whole book is to DESIGN AN ALGORITHM ABOUT HORNER's RULE AND ANAYLYZE IT. It's gone too far and incredible. (No wonder some students dislike the book...) BTW, I find myself appreciating the decent typeset and the pseudocode system used in this book.
<< 1 >>
| 
