Big Oh Notation???

Discussion in 'Programming' started by donhopkin, Feb 22, 2011.

0
  1. #1
    Could someone please explain this to me in a friendly way.. I am totally lost with this stuff.. my professor sucks.....

    Show big Oh notation for f(n)= 100000*2^(n-1)+nlogn . Please explain how you reached your conclusion.
     
    donhopkin, Feb 22, 2011 IP
  2. donhopkin

    donhopkin Peon

    Messages:
    29
    Likes Received:
    0
    Best Answers:
    0
    Trophy Points:
    0
    #2
    This is what i think, please correct me if i am wrong.

    100000 is constant so ignored it
    -1 is constant so ignored it
    nlogn is lower order than 2^n

    so f(n) = 100000*2^(n-1) +nlogn = O(2^n)
     
    donhopkin, Feb 22, 2011 IP
  3. sridhar_91

    sridhar_91 Peon

    Messages:
    16
    Likes Received:
    0
    Best Answers:
    0
    Trophy Points:
    0
    #3
    ^ yup, you're right. well explained :)
     
    sridhar_91, Feb 24, 2011 IP