Devil_DiabLo的博客

文章目录1.x^n2.merge sort3.Binary Search4.Fibonacci Numbers5.Matrix Multiplication--Strassen6.VLSIDivide and conquer1.divide2.conquer3.combined1.x^nT(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

文章目录NotesNotes1.Recursion Tree2.主定理例题：case 1: T(n)=4T(n/2)+nT(n)=4T(n/2)+nT(n)=4T(n/2)+nlog24=2,f(n)=O(n2)log_24=2,f(n)=\Omicron(n^2)log2​4=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)+n2log2

文章目录1.Notes2.Code1.Notes1.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