You must be able to read it. Algorithm basic book "algorithm diagram" __ algorithm

You must be able to read it. Algorithm base Book code example based on Python more than 400 diagrams, a vivid introduction to the implementation of the algorithm to show the advantages and disadvantages of the performance of different algorithms teach you to use common algorithms to solve daily problems faced by the actual programming

This book is easy to understand, there is no big span of thinking jump, every time the introduction of new concepts, are immediately interpreted, or point out where the interpretation will be. The core concepts are reinforced by practice and repeated interpretation so that you can test hypotheses and keep pace.

The book uses examples to help understand. My goal is to make it easy for you to understand these concepts, not to let the text read the road map

The first three chapters of this book will help you lay a good foundation.

The 1th chapter: you will learn the first practical algorithm-two-point search, will also learn how to use the Big O notation to analyze the speed of the algorithm. This book will use the Big O notation to analyze the speed of the algorithm from beginning to end.

The 2nd Chapter: you will learn two basic data structures--arrays and lists. These two data structures run through this book and are used to create more advanced data structures, such as the hash table introduced in chapter 5th.

The 3rd Chapter: you will learn recursion, a practical technique that is used by many algorithms (such as the quick sort introduced in chapter 4th).

In my experience, Big O notation and recursion are challenging for beginners, so I slowed down and spent a lot of time introducing the content.

The rest of the space will introduce an extensive application algorithm.

Problem solving skills: will be introduced in chapters 4th, 8 and 9. If you are unsure of how to solve the problem efficiently, try to divide and conquer (4th chapter) or Dynamic Planning (chapter 9th), and if you realize that there is no efficient solution at all, instead use the greedy algorithm (chapter 8th) to get an approximate answer.

Hash table: will be introduced in the 5th chapter. A hash table is a useful data structure that consists of key-value pairs, such as person names and e-mail addresses or user names and passwords. The use of a hash table is too great to emphasize. Whenever I need to solve a problem, the first two ways to think about it are: can I use a hash table? Can I use a diagram to build a model?

Graph algorithm: will be introduced in the 6th, 7 chapters. A graph is a method of simulating a network that includes a network of contacts, a road network, a neural network, or any set of connections. Breadth-First search (6th) and the Dixtra algorithm (chapter 7th) compute the shortest distance between two points in the network, which can be used to calculate the degree of separation between two people or the shortest path to the destination.

K Nearest Neighbor Algorithm (KNN): will be introduced in the 10th chapter. This is a simple machine learning algorithm that can be used to create a recommendation system, an OCR engine, a system for predicting stock prices or other values (such as "We think Adit will give this movie 4 stars"), and classifying objects (such as "This letter is Q").

What to do next: The 11th chapter outlines 10 algorithms that are appropriate for your further study.

various symbols. I also think that if you can recall the familiar situation, the learning effect will be the best, and the example will help to wake up the memory. So if you want to remember the difference between an array and a list (the 2nd chapter), just think about sitting in a movie theater looking for a seat. In addition, I am not afraid you say I long-winded, I am a visual learner, so this book contains a large number of illustrations.

The contents of this book are carefully selected. There is no need to introduce all the sorting algorithms in a book, or what Wikipedia and Khan College should do. All of the algorithms described in the book are very practical and helpful to the work of my software engineers and can provide a solid foundation for reading more complex topics. I wish you a happy reading. Directory

1th Chapter Algorithm Introduction
2nd Chapter Select Sort
3rd Chapter Recursion
4th Chapter Quick Sort
5th Chapter Hash List
6th Chapter Breadth First Search
7th Chapter Dixtra algorithm
8th Chapter Greedy algorithm
9th Chapter Dynamic Planning
The 10th Chapter K nearest Neighbor algorithm
11th chapter Next How to Do
Practice Answers