数据结构第一章教案分析.ppt

数据结构 1.1、什么是数据结构 1.2、基本概念和术语 1.3、算法的描述和分析 1.1、什么是数据结构 旅游交通网络图 1.2 基本概念和术语 高级程序语言中如何描述存储结构 “一维数组”类型描述顺序存储结构 “指针”类型描述链式存储结构 1.3 算法的描述和分析 一、算法 二、算法的特性 三、算法设计的原则 四、算法效率的衡量方法和准则 五、算法的存储空间需求 六、算法的描述 七、类C语言语法概要 八、算法的评价 八、算法的评价 1、执行算法所耗费的时间，即时间复杂度。 T(n)=O(f(n)) 2、执行算法所耗费的存储空间，其中主要考虑辅助存储空间的大小，即空间复杂度。记作 S(n)=O(f(n))其中，n为问题的规模（或大小）。 3、算法是否易读、是否容易转换成任何其它可运行的语言编制的程序以及是否易被测试等等。 若输入数据所占空间只取决于问题本身，和算法无关，则只需要分析除输入和程序之外的辅助变量所占额外空间。 若所需额外空间相对于输入数据量来说是常数，则称此算法为原地工作。 若所需存储量依赖于特定的输入，则通常按最坏情况考虑。 ALGORITHM ANALYSIS 【Definition】An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. In addition, all algorithms must satisfy the following criteria: (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. Note: A program is written in some programming language, and does not have to be finite (e.g. an operation system). An algorithm can be described by human languages, flow charts, some programming languages, or pseudo-code. 〖Example〗 Selection Sort: Sort a set of n ? 1 integers in increasing order. From those integers that are currently unsorted, find the smallest and place it next in the sorted list. Where and how are they stored? Where? for ( i = 0; i < n; i++) { Examine list[i] to list[n?1] and suppose that the smallest integer is at list[min]; Interchange list[i] and list[min]; } Sort = Find the smallest integer + Interchange it with list[i]. Algor