Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Asympto (C Analysis Addi (Onal Examples: Design and Analysis of Algorithms I

    Hochgeladen von

    igoysingh
    22 Ansichten5 Seiten
    This document contains examples of asymptotic analysis proofs. Example 1 proves a claim by choosing constants such that an inequality holds. Example 2 proves a claim by contradiction, assuming the opposite is true and deriving a false statement. Example 3 proves that for any two positive functions f(n) and g(n), if f(n) = O(g(n)) then g(n) = Ω(f(n)) by showing the functions are bounded above and below.

    Originalbeschreibung:

    part 4 algo

    Originaltitel

    Slides Algo-Asymptotic4 Typed

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Verfügbare Formate

    PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document contains examples of asymptotic analysis proofs. Example 1 proves a claim by choosing constants such that an inequality holds. Example 2 proves a claim by contradiction, assuming the opposite is true and deriving a false statement. Example 3 proves that for any two positive functions f(n) and g(n), if f(n) = O(g(n)) then g(n) = Ω(f(n)) by showing the functions are bounded above and below.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    22 Ansichten5 Seiten

    Asympto (C Analysis Addi (Onal Examples: Design and Analysis of Algorithms I

    Hochgeladen von

    igoysingh
    This document contains examples of asymptotic analysis proofs. Example 1 proves a claim by choosing constants such that an inequality holds. Example 2 proves a claim by contradiction, assuming the opposite is true and deriving a false statement. Example 3 proves that for any two positive functions f(n) and g(n), if f(n) = O(g(n)) then g(n) = Ω(f(n)) by showing the functions are bounded above and below.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Als PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 5

    Design

    and Analysis of Algorithms I

    Asympto(c Analysis Addi(onal Examples

    Example #1
    Claim : Proof : need to pick constants such that Note : So if we choose Q.E.D
    Tim Roughgarden

    then (*) holds.

    Example #2
    Claim : Proof : by contradic(on. If constants such that But then [cancelling ] Which is certainly false. Q.E.D
    Tim Roughgarden

    then there exist

    Example #3
    Claim : for every pair of (posi(ve) func(ons f(n), g(n),

    Tim Roughgarden

    Proof : For every n, we have And Thus

    Example #3 (con(nued)

    Q.E.D

    Tim Roughgarden

    Das könnte Ihnen auch gefallen