(1) Input There are zero or more quantities that are externally supplied. (2) Output At least one quantity is produced. (3) Definiteness Each instruction is clear and unambiguous. (4) Finiteness If we trace out the instructions of an algorithm, then for all cases, the algorithm terminates after finite number of steps. (5) Effectiveness Every instruction must be basic enough to be carried out, in principle, by a person using only pencil and paper. It is not enough that each operation be definite as in(3); it also must be feasible

第2章线性表 一、选择题 1.下述哪一条是顺序存储结构的优点?() A.存储密度大 B.插入运算方便 C.删除运算方便 D.可方便地用于各种逻辑结

1. Introduction : Problems with large programs 2.The Game of Life (a continuing example) 3. Programming style 4. Coding, Testing ,and Further Refinement 5. Program Maintenance 6. Preview (a) Software Engineering (b) Problem Analysis (c) Requirements Specification (d) Coding 7. Pointers and Pitfalls 8. References

第六章树和二叉树 第一节树的类型定义 A为“根” T1、T2和T3都是一棵树,称为A的子树。 称根和子树根之间的连线为“分支” 结点分支的个数定义为“结点的度”,如结点的度为2,D的度为3

void TSMatrix_add(TSMatr ix, TSMatr, TSMatrix&c)/三元组 表示的稀疏矩阵加法 { C. mu=A. mu; C. nu=A. nu; C. tu=; pa=1;pb=1;pc=1; for(x=1x<=A.mu;x++)//对矩阵的每一行进行加法 while(A. data [pa]. i