MIT Instoduction to Algorithms
文章平均质量分 73
study
孤独的咬杀君
记录学习工作笔记,共勉
展开
-
Lesson Three of MIT《Introduction to Algorithms》
文章目录1.x^n2.merge sort3.Binary Search4.Fibonacci Numbers5.Matrix Multiplication--Strassen6.VLSI Divide and conquer 1.divide 2.conquer 3.combined 1.x^n T(n)=T(n/2)+O(1)T(n)=T(n/2)+\Omicron(1)T(n)=T(n/2)+O(1) T(n)=O(logn)T(n)=\Omicron(logn)T(n)=O(logn) 2.merg原创 2021-01-26 19:30:59 · 99 阅读 · 0 评论 -
Lesson Two of MIT《Introduction to Algorithms》
文章目录Notes Notes 1.Recursion Tree 2.主定理 例题: case 1: T(n)=4T(n/2)+nT(n)=4T(n/2)+nT(n)=4T(n/2)+n log24=2,f(n)=O(n2)log_24=2,f(n)=\Omicron(n^2)log24=2,f(n)=O(n2),T(n)=Θ(n2)T(n)=\Theta(n^2)T(n)=Θ(n2) case 2: T(n)=4T(n/2)+n2T(n)=4T(n/2)+n^2T(n)=4T(n/2)+n2 log2原创 2021-01-26 16:08:35 · 118 阅读 · 1 评论 -
Lesson One of MIT 《Introduction to Algorithms》
文章目录1.Notes2.Code 1.Notes 1.why we study algorithms? Performance is the foundation of others. 2.asymptotic analysis: we can drop the lower order terms and ignore leading constants from a formula. asymptotic notation :theta notation Θ\ThetaΘ worst case. av原创 2021-01-18 22:55:19 · 116 阅读 · 0 评论