Algorithms book reviews Hello everyone, I am a translator

I just handed in the Chinese translation. I strongly recommend this English version. This is an algorithm book suitable for self-study and teaching materials. Compared with it, Tsinghua's algorithm textbooks are simply for primitive people. What are its characteristics?

1. Basic and comprehensive: two days ago saw a problem on Quora: What do you think the most genius algorithm has (http://www.quora.com)/What-are-some-of-thE-most-ingenious-algOrithms-in-computer-Science )? The benevolent and wise have said a lot. But if you really want to figure out the uniqueness of these algorithms, this book will give you an answer.

2. The illustration is clear and easy to understand: What do you see when you open a page of this book? Graph, graph, or graph. The reason why this book is thick is mostly one of the main reasons. After reading the book, there are very few page numbers on the paper. Compared with the boring teaching materials in China, the illustration in this book allows you to understand many algorithms you may have learned from a new perspective.

3. Less code: there is a reason why Java becomes a new generation of teaching language. Java's object-oriented and garbage collection features allow readers and students to focus their attention to the algorithm as much as possible. All the code in this book has no more than one page. There are only a few two or three consecutive pages of code, but each page is also self-contained. I really appreciate this because turning pages will interrupt the reader's thinking.

4. Low mathematical requirements: Have you read introduction to algorithms? Have you read Computing Theory? Does the proof in it make people crazy? This kind of thing does not exist in this book. This book looks at algorithms from a "practical" perspective. What is the best way to prove that an algorithm is useful and useful? In addition to the theoretical guarantee, the implementation is concise and the number of running time is king. The most used in this book is mathematical induction, because a lot of code is recursive. Probability Theory is rarely used. Only the last chapter describes a more profound Cook-Levin theorem. But to be honest, I don't think the author has made it clear. It is good for readers to remember the conclusion and comprehend the spirit.

5. API design: All algorithms in the book have their own APIs. In his book, The author practiced contractual programming and showed readers the advantages of this method. The author also summarized some principles about API design and analyzed them using some classes in the Java standard library as examples. These analyses are of great value to new beginners and old programmers.

6. Scientific Method: this is the essence of this book. Why? This is because Chinese students are missing. Do not think that the first chapter has 250 pages, but that the other chapter that explains the specific algorithm does not have the first chapter long. Therefore, the first chapter is a waste of layout. In the first chapter, the author laid the tone for the book, and scientific methods are the most important part. All algorithms follow the cycle of "conjecture-experiment. This is a natural way for humans to explore, scientific research, and scientific spirit we lack ".

　　
Disadvantages:
1. The big part is too thick. The English version has more than 900 pages, and the Chinese version is certainly not thin, which makes readers feel a little discouraged at first glance.
2. Sometimes it is a bit wordy, but this will be improved in the Chinese version.
　　
In short, this is a five-star book on Amazon, and the value is beyond doubt. Another book review on Amazon (written by Kevin P. Murphy) also summarizes the features of this book. If you want to learn algorithms and do not know where to start, or you already have a certain foundation, but are not willing to tangle with mathematical details, I strongly recommend this book to you.