MIT_CLRS_NOTES_mit_算法导论课堂笔记.docVIP

MIT CLRS NOTES 苑炜弢整理 Lecture 1 Analysis of algorithms theoretical study of computer programming performance making things run fast. speed is fun. Problem: sorting input: sequence a1,a2,,..., an of numbers output: permutation a1`, a2`,... Insertions sort (A, n) we use pseudocode Running time: Depends on input(eg , already sorted) Depends on input size( 6 elems vs 6 parameterize in input size Want upper bound guarantee to user Kinds of analysis worst case (usually) T(n)= max time on any input at size n (T(n) is a function) if delete max, T(n) will be a relation not a function Average case (sometimes) T(n)= expected time over all inputs of size n (need assumption of probability distribution) Best case (bogus) cheat with slow alg that work fast on some input for insertion sort, what is running time? depends on computer relative speed (on same machine) run two prog. on the same machine absolute speed (on diff machines) Insertion sort analysis worst case : input reverse sorted Time= Big Idea: Asymptotic Analysis (huge idea!!) Ignore machine dependent constants look at growth of T(n) as Asymptotic analysis major tool notation: drop low order terms ignore leading constants the constants will not influent the growth of n. if you compare the order of growth, after some point the slower growth alg will beat the faster growth alg. The constants will matter for the beating point of two diff growth alg, or when two alg have the same growth rate. when we have the input size of 300 or others , we should take the constant into consideration because of the practical situation. Insertion sort analysis: worst case : T(n)= = [arith analysis] this is upper bound of worst running time. the best running time will be . the growth for these situations are different. the algorithm running time will vary (not a function) but the worst running is a function. average case: T(n)= = it is a good sorting alg for small n ,