The 1th Chapter when we talk about algorithms, what are we talking about?
whether it's bat or flag, any kind of technical company with a bit of skill, interviewing is an algorithm. Why is the algorithm so important? Do you really use algorithms at work? What is the use of the algorithm? What are we talking about when we talk about algorithms?
2nd Chapter The basis of sorting
O (n^2) algorithm although simple, but also practical! Let's start with the simplest basic sorting algorithm and open our algorithm door!
The 3rd chapter advanced Sorting algorithm
Although many students have heard of merge sorting and quick sorting, what are the angles for optimizing merge sorting? Can a quick sort iterate over four versions? In this chapter, let's really understand these advanced sorting algorithms. The interview encountered these problems, no longer worry!
Chapter 4th heap and heap sequencing
In- depth exploration of the first data structure we want to learn, I believe that the introduction of this chapter, we can all whiteboard programming a heap structure! Also, have you heard of the index heap? It is an important tool for the follow-up optimization graph algorithm.
The 5th chapter of the second search tree
from binary searching to binary search tree, we make full use of recursive structure and write a fully functional tree structure. Do not underestimate the tree structure, whether it is more advanced data structure, or more complex algorithms, even in the field of artificial intelligence, this chapter is the foundation Oh.
The 6th chapter and the search set
together to achieve a tree-shaped structure of the heterogeneous-and check the set, and gradually optimize. This data structure, in the subsequent graph algorithm, will also play a significant role oh.
the basis of the 7th Chapter diagram
the basic knowledge of graph theory can help us to achieve a cool structure! How does the Magic wand function in Photoshop work? How to create a maze? Write your own kernel of a minesweeper game? Through this minimal chapter of learning, I believe you can have a certain understanding of the answers to these questions!
8th Chapter minimum Spanning tree
To get to the first serious question, let's see how the History of computer science solves this problem, and how we use the advanced data structures we learned to optimize.
9th Chapter Shortest Path
another very well-known graph problem. What is the difference between all kinds of shortest path algorithms? What's the difference between the use and the situation? And listen to my one by one-way.
10th Chapter Concluding remarks
Congratulations, you've finished the whole course. Next the algorithm has what content can learn, and listen to my one by one Tao. Learning, everyone refueling! ：）
: Baidu Network Disk download
Original address: http://linyunbbs.com/thread-2251-1-1.html
The algorithm and data structure of the procedure Ape's internal strength cultivation
