Scribd Logo
Upload

Welcome to Scribd!

  • Helping Notes

    Uploaded by

    mohsinsway
    4 views1 page
    The document describes common Big O notations used to analyze algorithms, including O(1) for constant time, O(logN) for logarithmic time where doubling the input size adds a fixed amount of time, O(N) for linear time where doubling the input size doubles the time, O(N^2) for quadratic time where doubling the input size quadruples the time, and O(2^N) for exponential time where the time increases exponentially with the input size. It provides a table comparing the time complexities for different input sizes.

    Original Description:

    Original Title

    helping notes.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes common Big O notations used to analyze algorithms, including O(1) for constant time, O(logN) for logarithmic time where doubling the input size adds a fixed amount of time, O(N) for linear time where doubling the input size doubles the time, O(N^2) for quadratic time where doubling the input size quadruples the time, and O(2^N) for exponential time where the time increases exponentially with the input size. It provides a table comparing the time complexities for different input sizes.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    Helping Notes

    Uploaded by

    mohsinsway
    The document describes common Big O notations used to analyze algorithms, including O(1) for constant time, O(logN) for logarithmic time where doubling the input size adds a fixed amount of time, O(N) for linear time where doubling the input size doubles the time, O(N^2) for quadratic time where doubling the input size quadruples the time, and O(2^N) for exponential time where the time increases exponentially with the input size. It provides a table comparing the time complexities for different input sizes.

    Copyright:

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

    The most commonly used Big O descriptions are

     O(1) always terminates in about the same amount of time, regardless of the input size.
     O(logN) takes a fixed additional amount of time each time the input size doubles.
     O(N) takes twice as long to finish if the input size doubles.
     O(N2) takes four times as long if the input size doubles.
     O(2N) increases exponentially as the input size increases.

    Input Size Time to Complete


     O(1) O(logN) O(N) O(N2) O(2N)
     1 1 1 1 1 1
     2 1 2 2 4 4
     4 1 3 4 16 16
     8 1 4 8 64 256
     16 1 5 16 254 65536

    You might also like