Scribd Logo
Upload

Welcome to Scribd!

  • A339649031 21482 13 2017 Complexities Example

    Uploaded by

    Pavneet
    15 views7 pages
    The document contains 15 examples of loops and their time complexities. The time complexities range from O(1) to O(nlogn) depending on the operations performed within the loops. Many of the examples involve doubling, halving, or taking square roots of the loop counter n to arrive at the time complexity.

    Original Description:

    complexities

    Original Title

    A339649031_21482_13_2017_complexities_example

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains 15 examples of loops and their time complexities. The time complexities range from O(1) to O(nlogn) depending on the operations performed within the loops. Many of the examples involve doubling, halving, or taking square roots of the loop counter n to arrive at the time complexity.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    15 views7 pages

    A339649031 21482 13 2017 Complexities Example

    Uploaded by

    Pavneet
    The document contains 15 examples of loops and their time complexities. The time complexities range from O(1) to O(nlogn) depending on the operations performed within the loops. Many of the examples involve doubling, halving, or taking square roots of the loop counter n to arrive at the time complexity.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    1.

    for(i=1; i<2*n; i=i*2)

    x=a+b;

    Ans: O(log2n)

    2.for(int j = 0; j < 133; j=j*2)

    x=a+b;

    Ans: O(1)

    3.for(i=1; i<=n/2; i++)

    for(j=1; j<=n; j=j*2)

    x=y+z;

    }
    }

    Ans:O(nlogn)

    4.while(n>=1)

    n=n/3;

    n=n/5

    Ans: O(log8n)

    5.while(n>=1)

    n=n-2;

    n=n/2;

    Ans: O(log2n)

    6.for(i=1; i<=n; i++)


    {

    j=2;

    while(j<=n)

    j=j*2;

    Ans: O(n(log2n))

    7.while(n>=2)

    n=vn;

    Ans: O(log(log2n))

    8.while(i=1; i<n; )

    n=n^2;

    Ans: O(log(log2n))
    9.while(n>=2)

    n=n^2;

    n=vn;

    n=n-2;

    Ans:O(n)

    10.while(n>=1)

    n=n*2;

    n=n/2;

    n=n+2;

    Ans:O(n)

    11.for(i=1; i<= n; i++)

    j=2;

    while(j<=n)

    j=j^2;
    }

    Ans: O(n(log(log2n)))

    12.for(i=1; i<=n; i++)

    j=2;

    while(n>=2)

    n=vn;

    Ans: O(n(log(log2n)))

    13.while(i=1; i<n; n=n+2)

    n=n+1;

    n=n*2;

    }
    Ans: O(log2n)

    14.for(i=1; i<=n; i++)

    j=2;

    while(n>=2)

    n=n/2;

    Ans: O(n(log2n))

    15.for(i=1; i<=n/2; i++)

    for(j=1; j<=133; j++)

    x=a+b;

    Ans:O(n)

    You might also like