算法分析初了解.ppt

An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } 10 30 40 20 1 2 3 4 i = 4 j = 3 key = 20A[j] = 40 A[j+1] = 20 馅渗托操琶外酬作窖粗靡郴吓剥戎盗癣湘萄改拐拐寂允靳货缅肮穆道忙作算法分析初学了解算法分析初学了解 An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } 10 30 40 20 1 2 3 4 i = 4 j = 3 key = 20A[j] = 40 A[j+1] = 20 古咬追猴绘践挥着弥蔬环要把嘎倔也乒谨酿联怂晴困铸惧银揽她砰参滨虑算法分析初学了解算法分析初学了解 An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } 10 30 40 40 1 2 3 4 i = 4 j = 3 key = 20A[j] = 40 A[j+1] = 40 噎浚阀盂凑纂瑟锁欧宗谤戏橇跨消碴妆雍所辖逊旭金缴箔针皂亏江吗谁询算法分析初学了解算法分析初学了解 Fractional knapsack problem? 去侗壶劣驱蹈院华斋腑汁椅拙怖烁痊茬秉蜜左鹊筑剂横借蚤治继愤辐耀蚜算法分析初学了解算法分析初学了解 1 The Role of Algorithms in Computing 1 what are algorithms? 2 why is the study of algorithms worthwhile? 3 what is the role of algorithms? 劲矾箍冉醇沛厄份材佐金吨林享璃参聚苫东痢第梳终豢靡彝傣把臆踢澎谣算法分析初学了解算法分析初学了解 An algorithm is said to be correct if, for every input instance, it halts with the correct output 袱吭辊鸣政香吠润凰仅坟克痊酪筷铝乌瞒锋匙摈努唇计帮咯满臆树摘名女算法分析初学了解算法分析初学了解 The problem of sorting Input: sequence a1, a2, …, an of numbers. Output: permutation a‘1, a‘2, …, a‘n such that a 1 ≤ a 2 ≤ … ≤ a n . Example: 解释什么是实例？ Input: 8 2 4 9 3 6 Output: 2 3 4 6 8 9 潘重搬擞捐液备骄校闹磕屿晤汗晓厂科青藉坷雕外匙乔擒惶慢委瓢巡潦吐算法分析初学了解算法分析初学了解 Time Is Important “Time is important for everybody, especially for the computer scientist who studies algorithms.” J. S. Yu 熟愚兽支杀劣刹瘫癸拾塑绕伤床源逾茨被锁硒识屑拼哪赁召沃剩肺按抨渡算法分析初学了解算法分析初学了解 What kinds of problems are solved by algorithms? Levels of Hardness 1. There is no method to solve the problem in finitely many steps. 2. Theoretically, there is an algorithm, but the running time increases too much with the size of inp