算法：C语言实现（Algorithms In C）的学习

这是chapter 1的Introduce部分

原文：Readers of thisbook are expected to have at least a year's experience programming in high andlow-level languages. Also, some exposure to elementary algorithms on simpledata structures such as arrays, stacks, queues, and trees might be helpful,though this material is reviewed in some detail in Chapters 3 and 4. An elementaryacquaintance with machine organization, programming languages, and other basiccomputer science concepts is also assumed. (We’ll review such material brieflywhen appropriate, but always within the context of solving particularproblems.) A few of the application areas we deal with require knowledge ofelementary calculus. We’ll also be using some very basic material involvinglinear algebra, geometry, and discrete mathematics, but previous knowledge ofthese topics is not necessary.

理解：阅读这本书的读者最好是有一年以上的高级和低级语言的编程经验。懂得如，数组，堆，队列和树的这些基本的数据结构。要熟悉计算机结构，编程语言和其它一些基础的计算机概念。在某些地方会要到微积分，线性代数，几何学和离散数学的知识。

 

原文：In writing acomputer p