[高等教育]第8章算法.ppt

Figure 8-12: part II Example of selection sort Figure 8-13 Selection sort algorithm Figure 8-14 Bubble sort 8.5.4 排序 2.冒泡排序 Figure 8-15: part I Example of bubble sort Figure 8-15: part II Example of bubble sort Figure 8-16 Insertion sort 8.5.4 排序 3.插入排序 8.5.4 排序 4.其他排序算法 Figure 8-17: part I Example of insertion sort SHZ, 2010 Chapter 8 Algorithms 第8章 算法 Understand the concept of an algorithm. Define and use the three constructs for developingalgorithms: sequence, decision, and repetition. Understand and use three tools to represent algorithms:flowchart, pseudocode, and structure chart. After reading this chapter, the reader should be able to: OBJECTIVES Understand the concept of modularity and subalgorithms. List and comprehend common algorithms. CONCEPT 8.1 算法：一种逐步解决问题或完成任务的方法 概念 Figure 8-1 Informal definition of an algorithm used in a computer 算法的非正式定义 Figure 8-2 Finding the largest integer among five integers 8.1.2 示例 从五个整数中找出最大值 Figure 8-3 Defining actions in FindLargest algorithm 定义算法的动作： Figure 8-4 FindLargest refined 精化：算法动作的标准化 Figure 8-5 Generalization of FindLargest 泛化：使算法能够适应一般情况 THREE CONSTRUCTS 8.2 算法的三种基本结构： 顺序、选择、循环 三种结构 Figure 8-6 Three constructs ALGORITHM REPRESENTATION 8.3 算法的表示 Figure 8-7 Flowcharts for three constructs 流程图 Figure 8-8 Pseudocode for three constructs 伪代码 Example 1 Write an algorithm in pseudocode that finds the average of two numbers Solution See Algorithm 8.1 on the next slide. AverageOfTwo Input: Two numbers Add the two numbers Divide the result by 2 Return the result by step 2 End Algorithm 8.1: Average of two Example 2 Write an algorithm to change a numeric grade to a pass/no pass grade. Solution See Algorithm 8.2 on the next slide. Pass/NoPassGrade Input: One number if (the number is greater than or equal to 70)then 1.1 Set the grade to “pass” else 1.2 Set the grade to “nopass” End if Return the grade End Algorithm 8.2: Pass/no pass Grade Example 3 Write an algorithm to change a numeric grade to a