数据结构与算法分析 Java语言描述=Data Structures and Algorithm Analysis in Java (韦斯 (Mark Allen Weiss),冯舜玺)

 This book describes data structures, methodsof organizing large amounts of data, and algorithm analysis, the estimation ofthe running time of algorithms. As computers become faster and faster, the needfor programs that can handle large amounts of input becomes more acute.Paradoxically, this requires more careful attention to efficiency, sinceinefficiencies in programs become most obvious when input sizes are large. Byanalyzing an algorithm before it is actually coded, students can decide if aparticular solution will be feasible. For example, in this text students lookat specific problems and see how careful implementations can reduce the timeconstraint for large amounts of data from 16 years to less than a second.Therefore, no algorithm or data structure is presented without an explanationof its running time. In some cases, minute details that affect the running time of the implementation are explored.

书python33点（0M

     这本书描述了数据结构（组织大量数据的方法）和算法分析（算法运行时间的估计）。随着电脑变得越来越快，就对程序可以处理大量输入有更高的需求。矛盾的是，这就要求对效率更加注意，因为当输入大量数据时，程序的低效率最为明显。在算法被实际编码前分析该算法，学生们就可以确定这个方案是否可行。例如，在本书中学生们会看到一些特殊的问题以及认真仔细的实现是如何将大量数据的时间限制从16年变成不到一秒的。因此，没有一个算法或数据结构是与运行时间的解释无关的。在一些情况中，就要探究影响实现的运行时间的微小细节。

   Once a solution methodis determined, a program must still be written. As computers have become more powerful, the problems they solve have becomelarger and more complex, thus requiring development of more intricate programsto solve the problems. The goal of this text is to teach students goodprogramming and algorithm analysis skills simultaneously so that they candevelop such programs with the maximum amount of Efficiency.

      一旦确定一个解决方案，就会写出一个程序。随着电脑的功能越来越强大，他们需要解决的问题就越来越大，越来越复杂，因此就需要更加复杂的程序去解决这些问题。本书的目的就是教学生同时掌握好的编程技能和算法分析技能，使他们可以开发出最高效的程序。

   This book is suitable for either an advanceddata structures (CS7) course or a first-year graduate course in algorithmanalysis. Students should have some knowledge of intermediate programming,including such topics as pointers and recursion, and some background indiscrete math.

    这本书适合于任一高级数据结构（CS7）课程或研究生一年级的算法分析课程。学生们应该懂一些作为中介的编程知识（包括指针，递归等）和一些离散数学的知识。

 

Approach

方法

 

   I believe it isimportant for students to learn how to program for themselves, not how to copyprograms from a book. On the other hand, it is virtually impossible to discussrealistic programming issues without including sample code. For this reason,the book usually provides about half to three-quarters of an implementation,and the student is encouraged to supply the rest.

    我认为对于学生来说重要的是怎样写出自己的程序而不是怎样从一本书里抄袭程序。另一方面，不用示例代码讨论实际编程问题几乎是不可能的。出于这个原因，本书通常会提供实现的大约八分之三的内容，剩下的部分就由学生补充。