tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 6 - Dr. Sohail Aslam

You may be asking that we continue to use the notation Θ() but have never defined it. Let’s remedy this now. Given any function g(n), we define Θ(g(n)) to be a set of functions that asymptotically equivalent to g(n). Lecture Design and Analysis of Algorithms: Lecture 6 include all of the following: Asymptotic Notation, 2-Dimension Maxima Revisited. |