《数据结构与算法分析》（国外英文资料）.doc

《数据结构与算法分析》（国外英文资料） Reading is three to one, which is to say, the mind to the eye, to the mouth. The heart is not here, but the eye is not careful, but the mind is not one, but only read the wave, not to remember, not long also. Three to the middle, the heart to the most urgent, the heart is at the same time, the eye is not to the eye? -- zhu xi, the rules of training Reading a good book is like having a good friend. - hide KeGu Data structure and algorithm analysis -- the main content of the course content system Unit module Specific teaching content The introduction The introduction is part of the books preparatory knowledge, which is a simple introduction to ADL language, data structure and algorithm, analysis foundation, OOP, and c + + Basic data structure Part basic data structures including linear list, stack and queue, arrays, strings, integers, collection classes, tree (including the AVL tree, stretch, etc.), figure (including network flow problems such as discussion), Hash (Hash), etc A typical algorithm Part mainly introduces the typical algorithm of some typical algorithms, and gives the necessary complexity analysis and comparison process, including recursive, sorting, search and memory management, etc Complex data structure Complex data structures include priority queues, unintersected collections, and file structures Algorithm design technique The design techniques of the typical algorithm include greedy algorithm, divide-and-conquer algorithm, dynamic programming, backdating algorithm and randomization algorithm application Application part is the data structure and some application examples of typical algorithm, including event driven simulation, equivalence class, the imperfect board and discuss the problems of the image compression and permission in class will introduce amortization analysis, red and black tree, etc Data structure and algorithm analysis The main content of the course practice content system Practice teaching unit module The basic r