计算机导论教学-ch08[Part3.Computer SW] Algorithms.pptVIP

flowchart：流程图。使用大图的形式掩盖了算法的所有细节，只显示算法从开始到结束的整个流程。 pseudocode:伪代码。类似英语的表示法。 More formal definition:更正式的定义 1、Ordered set：有序集合。 2、unambiguous steps：明确步骤 3、produce a result：产生结果。 4、terminate in a finite time：在有限的时间内终止。 subalgorithm：子算法。 subprogram：子程序 subroutine：子例程 procedure：过程 function：函数 method：方法 module：模块 Basic algorithm：基本算法。 summation：求和 product：乘积 Smallest and largest：最大和最小 sorting：排序 Selection sort：选择排序 Bubble sort：冒泡排序 Insertion sort：插入排序 Searching：查找 Sequential search：顺序查找 binary search：折半查找 Write a recursive algorithm in pseudocode to realize binary search RecursiveBinarySearch Input: key ,first and last 1. if(firstlast) then 1.1 return fail End if 2. mid=(first+last)/2 3. if(list[mid]==key) then 3.1 return mid else 3.2 if(list[mid]key) then 3.2.1 return RecursiveBinarySearch(key,first,mid-1) else 3.2.2 return RecursiveBinarySearch(key,mid+1,last) End if End if End Draw a flowchart for an algorithm that finds the largest of a set of integers. You do not know the number of integers. Concept of a subalgorithm FindLargest Input: A list of positive integers Set Largest to 0 while (more integers) 2.1 FindLargerEnd while Return Largest End Algorithm 8.6: Find largest FindLarger Input: Largest and current integer if (the integer is greater than Largest)then  1.1 Set Largest to the value of the integerEnd ifEnd Subalgorithm: Find larger BASIC ALGORITHMS 8.6 Summation Product Selection sort 交换（第k个最小元素） Example of selection sort Example of selection sort Selection sort algorithm Bubble sort Example of bubble sort Example of bubble sort Insertion sort Example of insertion sort Example of insertion sort Search concept Example of a sequential Search Example of a sequential Search Example of a binary sort RECURSION 8.7 Iterative(迭代)definition of factorial(阶乘) Recursive(递归)definition of factorial Tracing recursive solution to factorial problem Factorial Input: A positive integer num Set FN to 1 Set i to 1 while (i is less than or equ