Scribd Logo
Upload

Welcome to Scribd!

  • Plot Times

    Uploaded by

    Joe Williams
    4 views3 pages
    The document contains runtime complexity data for algorithms with complexities of O(n), O(n^2), and O(n^2)+O(n) across a range of input sizes from 100,000 to 1 billion. The O(n) algorithm scales linearly with input size while the O(n^2) and O(n^2)+O(n) algorithms scale quadratically and have significantly higher runtimes than the O(n) algorithm for larger inputs.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains runtime complexity data for algorithms with complexities of O(n), O(n^2), and O(n^2)+O(n) across a range of input sizes from 100,000 to 1 billion. The O(n) algorithm scales linearly with input size while the O(n^2) and O(n^2)+O(n) algorithms scale quadratically and have significantly higher runtimes than the O(n) algorithm for larger inputs.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    4 views3 pages

    Plot Times

    Uploaded by

    Joe Williams
    The document contains runtime complexity data for algorithms with complexities of O(n), O(n^2), and O(n^2)+O(n) across a range of input sizes from 100,000 to 1 billion. The O(n) algorithm scales linearly with input size while the O(n^2) and O(n^2)+O(n) algorithms scale quadratically and have significantly higher runtimes than the O(n) algorithm for larger inputs.

    Copyright:

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

    100000 150000 300000 400000 3000000 900000000 1000000000

    O(n) 0.001 0.001 0.001 0.002 0.016 4.971 0.548 1000


    O(n2) 52.476 119.997 475.706 872.798 1000 900
    2
    O(n ) + O(n) 52.63 119.552 474.158 876.439 1000 800
    700
    600
    500
    400
    300
    200
    100
    0
    100000
    1500
    1000
    900
    800
    700
    600
    500
    400
    300
    O(n)
    200
    O(n2)
    100 O(n2) + O(n)
    0
    100000
    150000
    300000
    400000
    3000000
    900000000
    1000000000
    O(n)
    O(n2)
    O(n2) + O(n)

    You might also like