Scribd Logo
Upload

Welcome to Scribd!

  • Analysis of Algorithms Lecturer: Mr. Paul Gaynor Lecture 6: Asymptotic Analysis

    Uploaded by

    jevanjunior
    15 views5 pages
    This document discusses asymptotic analysis, which compares how functions grow relative to each other for very large values. It defines the asymptotic notations of O(g(n)) as growing no faster than g(n), Ω(g(n)) as growing at least as fast as g(n), and Θ(g(n)) as growing at approximately the same rate as g(n). It also describes properties of asymptotic bounds, such as Θ(f)Θ(g) = Θ(fg), Θ(f)+Θ(g) = Θ(max(f,g)), and cΘ(f) = Θ(cf) = Θ(f). The

    Original Description:

    Original Title

    cs20r_Lecture6

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses asymptotic analysis, which compares how functions grow relative to each other for very large values. It defines the asymptotic notations of O(g(n)) as growing no faster than g(n), Ω(g(n)) as growing at least as fast as g(n), and Θ(g(n)) as growing at approximately the same rate as g(n). It also describes properties of asymptotic bounds, such as Θ(f)Θ(g) = Θ(fg), Θ(f)+Θ(g) = Θ(max(f,g)), and cΘ(f) = Θ(cf) = Θ(f). The

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    15 views5 pages

    Analysis of Algorithms Lecturer: Mr. Paul Gaynor Lecture 6: Asymptotic Analysis

    Uploaded by

    jevanjunior
    This document discusses asymptotic analysis, which compares how functions grow relative to each other for very large values. It defines the asymptotic notations of O(g(n)) as growing no faster than g(n), Ω(g(n)) as growing at least as fast as g(n), and Θ(g(n)) as growing at approximately the same rate as g(n). It also describes properties of asymptotic bounds, such as Θ(f)Θ(g) = Θ(fg), Θ(f)+Θ(g) = Θ(max(f,g)), and cΘ(f) = Θ(cf) = Θ(f). The

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as ppt, pdf, or txt
    of 5

    Analysis of Algorithms Lecturer: Mr.

    Paul Gaynor Lecture 6: Asymptotic analysis

    Sketch of common functions

    Source: CS20A Bed Manual

    Comparing functions

    Asymptotic Analysis compares functions based on behaviour when working with very large values Given two functions f(n) and g(n) f(n) = O(g(n))
    =>f(n) grows no faster than g(n) (there exists no and c, st. for all n>= no, f(n) <= cg(n) )

    f(n) = (g(n)) =>f(n) grows at least as fast as g(n) (there exists no and c, st. for all n>= no, f(n) >= cg(n) ) F(n) = (g(n)) => f(n) grows at approximately the same rate as g(n) (there exists no ,c1 and c2, s.t. for all n>= no, f(n) <= c1g(n) and f(n) >= c2g(n) )

    Note O, , represent ranges

    Properties of Asymptotic Bounds


    (f) (g) = (fg)


    Eg. (x) (x2) = (x3)

    (f) + (g) = (f + g) = (max(f,g))


    Eg. . (x) + (x2) = (x2)

    c(f) = (cf) = (f)


    Eg. 5*(x2) = (5x2) = (x2)

    Sources

    Computer Algorithms
    Sara Baase, Allan Van Gelder

    CS20A BEd Manual


    Richard Lawson, Daniel Coore

    You might also like