Algorithm recommendation Book (Programmer exercise + Popular Science)

Turing Small series "for a long time not in the blog activities ~ Small series accumulated a lot of good newsletter can't wait to recommend to everyone, now from the algorithm book start bar ~ actually Turing algorithm book not much, but each has a characteristic, by readers welcome, today said 8, plus 1 of the takeaway ~"

Get started first book, you will be able to read

There is no dull description, no hard-to-understand formula, everything is based on practical application, with humorous language with lovely illustrations to explain the algorithm. You are more likely to read a simple story or play a fun puzzle game, in a relaxed and enjoyable to grasp the essence of the algorithm, feel the beauty of the algorithm.

The data structures covered in this book are stack, queue, linked list, tree, and check set, heap and graph, etc. the algorithms involved are sort, enumeration, depth and breadth-first search, graph traversal, and of course, there are four shortest path algorithms, two minimum spanning tree algorithms, cutting point and cutting edge algorithm, and the maximal matching algorithm of binary graph in graph theory.

Watercress 8.1 min

"Illustrations and explanations are quite in place ~ ~ Let people look very interested, the algorithm with a very image of the way to express, easy to understand, this learning algorithm of the friend blessed. ”

Getting Started + Advanced, Classic Classics

• Sedgewick's masterpiece, with Gartner TAOCP same strain
• Several decades of revisions, enduring bestseller
• Covering 50 algorithms that all programmers must master

As a classic reference book in the field of algorithm, it introduces the necessary knowledge of algorithms and data structures, especially for sorting, searching, graph processing and string processing. The 4th edition specifically gives each programmer haulage 50 algorithms, provides the actual code, and these Java code implementation of the modular programming style, the reader can easily be modified. The book supporting site provides a summary of the contents of the book and more code implementation, test data, exercises, teaching courseware and other resources.

Watercress 9.3 min

"This book is also very cow, with Java implementation, I think this book is the most suitable for the introduction of the algorithm, said it is suitable for the introduction is not to say it is too shallow, but to speak in simple, very easy to understand, inside those small color map Ah, gee, beautiful! ”

Advanced preferred, and real life closest to the interesting algorithm book

The size of the algorithm, large to include the universe of all things in the operation of the law, the algorithm is small, small to a few lines of code can show a magical function. The application and fun of algorithms is ubiquitous in life:

• The calendar and coodination calculations use the law of Horner and the Newton iterative method for solving a unary equation.
• A discrete Fourier transform algorithm is behind the real-time spectrum of the audio player's beating.
• The famous PCX image file format of the DOS era uses a simple and effective rle compression algorithm;
• Under the halo of RSA encryption algorithm, the simple Euclidean algorithm, the Montgomery algorithm and the Miller-Rabin algorithm;
• Behind the Kanki, Othello, Gobang and Tetris games are a variety of interesting AI algorithms;
• There is a hashing algorithm for the checkerboard state in the simple and exhaustive algorithm of Huarong game.
• Genetic algorithms are mysterious and unpredictable, but using genetic algorithms to solve 0-1 knapsack problems is only used in more than 60 lines of code ...

A book takes you into the colorful algorithmic world and lets you enjoy the algorithm.

New Listings

This book is different from the usual algorithmic book, which is more interesting than I thought:
"The book only in the first three chapters systematically introduced the logical structure of the various algorithms, then the chapters are based on the specific problem of the construction algorithm, has always thought that dynamic planning is how tall on the method, by the author's introduction and examples, seems to understand some. The original graduation design is to do is a Tetris game, but only to play, no computer AI, read the book just know Tetris has so many famous algorithms. ”

ACM MUST-read

• Introduction to ACM
• Top Master Masterpiece
• Korea's best algorithmic combat book

By answering the questions in the programming contest, the book enables readers to learn the design techniques and algorithm structure of various algorithms, which can improve the reader's problem solving ability.

New Listings

In the first chapter of this book, the purpose and significance of the program design are given straight to the point. By enumerating examples, readers who have not been exposed to program design contests have an intuitive and understandable understanding of programming. The author also enumerates the advantages of the program design contest, the level of the hierarchy, the strong organization, simple without losing depth to the reader to introduce the program to the competition can benefit a lot. At the same time, the author also gives suggestions and methods to read this book, so that readers can read this book more efficient.

Unlike most books that introduce algorithms, the book also introduces readers to the program design contests that are worth attending, which is helpful for those interested in competing. The second chapter of the book does not like some of the introduction of the algorithm to start directly into the algorithm to explain, but to the reader in detail how to solve the problem, through the problem-solving process and the strategy to solve the problem of the two parts of the detailed introduction, so that the reader can understand the essence of the algorithm problem is what, the solution of the problem of These are very important to the reader of the learning algorithm and need to be understood from the beginning. The book is very good at this, and is a good book for readers who want to learn and learn algorithms.

• A summary of the experience of the world's top programming gurus
• "ACM-ICPC Global Championship" Wa Zejun main translation
• Japanese ACM-ICPC contestant attendee

This book summarizes the basic algorithms and classical problems in the contest of program design, which are divided into 4 chapters: preparation, beginner, intermediate and advanced. The author combined with his rich experience in the competition, the strict screening of more than 110 different types of questions carried out from the simple, easy and difficult to explain carefully, and introduced a lot of practical skills. Each chapter is accompanied by exercises for the reader to practice and consolidate the learning.

Watercress 9.0 min

"Through this book, I'm Getting started with algorithmic contest questions. ”

General Knowledge 3, each leading the way

Today, the field of algorithmic involvement has gone far beyond the expectations of its creators. Especially after entering the information age, the application of the algorithm covers financial, medical, legal, sports, entertainment, diplomacy, culture, national security and many other aspects, showing the human and beyond the powerful power of mankind. This book is another masterpiece of the New York Times bestseller author, who, through a fascinating story, introduces the reader to the reality of how the algorithm controls the world, revealing how the robotic revolution has crept around us.

Watercress 7.3 min

"Math and algorithms are so addictive that they change the world's limitless potential, but most people don't see it." ”

Suppose a traveler intends to visit all the cities in a list of cities, each city only once, and finally back to the place of departure. How do we get to the shortest route? This is the travel business problem, at first glance, it is very simple, in the application of mathematics in the field is a very hot problem, still no one can solve today. In this book, William J. Cook will lead the reader on a mathematical journey, following the footsteps of the traveler, from the early 19th century Irish mathematician W. R. Hamilton initially defined the issue and ran to the forefront of today's top-of-the-line problem-solving attempts.

Watercress 8.1 min

"Everything about the classic tsp problem ... The TSP problem seems simple, especially when the problem is small, the optimal solution seems self-evident, but when the size of the problem continues to expand, even the human brain such "super-scale parallel" Wetware will immediately feel at a loss, and then "confused." That eventually let us out of the dark, not concede the wisdom of the spark again in the warm burning relay, so there is the nearest neighbor algorithm, with the greedy algorithm, with the insertion algorithm, with the Christofides algorithm, with the LKH algorithm, with a linear programming algorithm. ”

• Vint Cerf and many other world-class computer scientists recommend
• "Publisher Weekly" Science and other magazines praise the Tide
• A brief history of time as a humorous p/np problem
• A feast on computation, Mathematics and logic

Watercress 7.4 min

"This book deals with all aspects of the P/NP problem and is not too deep for such a thin booklet, but I believe readers have read a macro understanding of this issue. The author has done very well. This book is a ticket to bring the reader into this wonderful world. ”

Of course, when it comes to algorithmic books, there's another one that has to be recommended.　

Watercress 9.1 min

Classic, authoritative, comprehensive, rigorous, the only problem is that it's a little difficult to understand.

Poke in the bottom left corner "read the original" jump to the Turing community to view the 2015 Turing Book catalogue, download the PDF in "Book with Me". Small series warm remind everyone to download in the WiFi environment ~

Read the original

Algorithm recommendation Book (Programmer exercise + Popular Science)