数据结构英文课件：ch01 Programming Principles.ppt

* 乘法规则 针对嵌套程序段 T (n, m) = T1 (n) * T2 (m) = O(f (n)*g (m)) 两个并列循环的例子 * void exam (float x[ ][ ], int m, int n) { float sum [ ]; for (int i = 0; i m; i++) { //x中各行 sum[i] = 0.0; //数据累加 for (int j = 0; j n; j++) sum[i] += x[i][j]; } for (i = 0; i m; i++) //打印各行数据和 cout i “ : ” sum [i] endl; } 渐进时间复杂度为 O(max (m*n, m)) 渐近的空间复杂度 S (n) = O(f (n)) * * This chapter involves four parts * Can deal with , the set must have a lot of subset ,such as the subset of digits, characters, strings, pictures, records, music songs, sounds, and so on. If we draw a large circle as the data set, every subset can be represented as a smaller circle, every subset has many objects in it, and also it can have many subsets. Every Data element is an independent individual in the data set. For example, a digital number, a character, a student record and so on. So the number, name, score are three data items of the student record. * A set of data elements, the elements have some relations. For example, there are 9 students in a research group, except a head of the group, the others are divided into four groups, every group have a leader, we can described the data structure as a sketch map like this Another example, a queue of waiting line, every one in the queue has his own location, the relation between them are front and rear. From this example, we can conclude the relations between the data elements are intrinsic, they are not depending on how we stored them in the computer and if it is stored or not. * How to store the elements and the relation between them in a computer the logical relation between the elements are represented by the location relation when they are stored in a block of contiguous memory. Usually we used the data type array in programming language to implement contiguous structure. The logical relation between the elements are re