Explore BrainMass

Explore BrainMass

    Using Big O notation

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Use only the definition of O(f(n)) to prove that the following statements are true:

    1. (6n^3*log n + 1)/2n +1000 = O(1)
    2. nlog n + n^3/2 = O(n^3/2)

    Please view the attachment below for the full question.

    © BrainMass Inc. brainmass.com February 24, 2021, 2:05 pm ad1c9bdddf
    https://brainmass.com/computer-science/algorithms/big-o-notation-proofs-1650

    Attachments

    Solution Summary

    Using Big O notation is emphasized.

    $2.19

    ADVERTISEMENT