Introduction to Algorithmic reading order

For computer science, especially for the development of the people, the algorithm is a very important internal strength, its importance is self-evident. It is also a difficult point. When you have been Amway countless times "Introduction to the algorithm", picked up the book but found that the fundamental reading cannot go on.

In this Chat I will tell you how to be a beginner in the right position to read the basic part of the book in 10 days, I will step by step to tell you how each chapter should be read, specific to the order of reading. The pro-test is effective. The fundamental part of the algorithm includes: the algorithm's application in the calculation of the basic function of the growth of the division strategy heap sorting fast sorting linear time sorting median and order statistics basic data structure (stack, queue, linked list) hash table The basic algorithm of greedy algorithm graph for binary search tree dynamic programming minimum spanning tree single source point shortest path

After learning your achievements: more systematic understanding of basic algorithms and data structure knowledge to form a good calculation