Scribd Logo
Upload

Welcome to Scribd!

  • Data Structure

    Uploaded by

    Antara Roy
    1 views2 pages
    Big O notation describes the performance of algorithms, specifically analyzing worst-case scenarios of execution time and space usage depending on input size. Common notations include O(1) for constant time regardless of input size, O(N) for linear time proportional to input size, O(N^2) for quadratic time proportional to the square of input size, and O(2^N) for exponential time that doubles with each addition to input size.

    Original Description:

    Original Title

    DATA STRUCTURE.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
    Big O notation describes the performance of algorithms, specifically analyzing worst-case scenarios of execution time and space usage depending on input size. Common notations include O(1) for constant time regardless of input size, O(N) for linear time proportional to input size, O(N^2) for quadratic time proportional to the square of input size, and O(2^N) for exponential time that doubles with each addition to input size.

    Copyright:

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

    Data Structure

    Uploaded by

    Antara Roy
    Big O notation describes the performance of algorithms, specifically analyzing worst-case scenarios of execution time and space usage depending on input size. Common notations include O(1) for constant time regardless of input size, O(N) for linear time proportional to input size, O(N^2) for quadratic time proportional to the square of input size, and O(2^N) for exponential time that doubles with each addition to input size.

    Copyright:

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

    BIG OH NOTATION

    Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-
    case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.

    Below are the different types of O notations :

    O(1)

    O(1) describes an algorithm that will always execute in the same time (or space) regardless of the size of the input data set.

    O(N)

    O(N) describes an algorithm whose performance will grow linearly and in direct proportion to the size of the input data set.

    O(N2)

    O(N2) represents an algorithm whose performance is directly proportional to the square of the size of the input data set. This is common with
    algorithms that involve nested iterations over the data set.

    O(2N)

    O(2N) denotes an algorithm whose growth doubles with each additon to the input data set. The growth curve of an O(2 N) function is
    exponential - starting off very shallow, then rising meteorically.

    You might also like