递归数列及函数增长—算法分析初步.pdfVIP

递归数列及函数增长—算法分析初步 离散数学教学组 排序算法--插入排序 遍历所有元素： 构造已排序的子序列 将待排序元素插入子序列中的合适位置 插入排序的伪代码 插入排序的时间复杂度  最坏情形下（用比较次数来衡量）  (2-1)+(3-1)+…+(n-1)=n(n-1)/2 2  O(n )  最坏情形：待排序元素完全逆序！  比如：6 5 4 3 2 1 算法的执行步骤数：算法分析初步  算法的正确性，算法的效率  如何去评判一个算法的效率？  时间开销: steps  空间开销: memory  算法的执行步骤数是关键  不是简单的算法语句条数！ 汉诺塔递归算法的性能分析  Towers of Hanoi  How many moves are need to move all the disks to the third peg by moving only one at a time and never placing a disk on top of a smaller one. void hanoi(int n,char one, two, three) // 将n个盘从one座借助two座,移到three座 { void move(char x, char y); if(n==1) then move(one,three); else { T(1) = 1 hanoi(n-1,one,three,two); move(one,three); T(n) = 2T(n-1) +1 hanoi(n-1,two,one,three); } } Solution of Towers of Hanoi T(n) = 2T(n-1) + 1 2T(n-1) = 4T(n-2) + 2 n 4T(n-2) = 8T(n-3) + 4 T(n) = 2 -1 ……. 2n-2T(2) = 2n-1T(1) + 2n-2 Recurrence relations (递推关系)  Examples  4,7,10,13,16,……  1,1,2,3,5,8,13,21,34,…… (a)  Problem  Recurrence relation: the recursive formula  e.g: f = f +f , f =f =1 for (a) n n-1 n-2 1 2  f =f =1: initial condition 1 2 Example  Let A={0,1}.  C : the number of strings of length n in A* n that do not contain adjacent 0’