Results 1 to 4 of 4

Thread: Big-O computation

  1. Oct 11th, 2002, 09:34 AM #1
    proff.hacker
    proff.hacker is offline

    Thread Starter
    Hyperactive Member
    Join Date
    Jul 2001
    Location
    Earth
    Posts
    277

    Question Big-O computation

    could anyone help me in the following question
    Show that the function f(n) = 4n2 + 6n + 1 is O(n2) by finding the suitable values of c and n0

    Reply With Quote Reply With Quote
  2. Oct 11th, 2002, 10:02 AM #2
    HairyDave
    HairyDave is offline
    Addicted Member HairyDave's Avatar
    Join Date
    Aug 2002
    Location
    Er...I can't remember.
    Posts
    196
    Have a look at http://www.nist.gov/dads/HTML/bigOnotation.html for some information.

    HD
    Reply With Quote Reply With Quote
  3. Oct 11th, 2002, 11:14 AM #3
    proff.hacker
    proff.hacker is offline

    Thread Starter
    Hyperactive Member
    Join Date
    Jul 2001
    Location
    Earth
    Posts
    277
    thanks HairyDave for the site u gave me


    it seems to be helpful but I couldn't get help
    Reply With Quote Reply With Quote
  4. Oct 12th, 2002, 01:14 PM #4
    Havoc
    Havoc is offline
    New Member
    Join Date
    Oct 2002
    Location
    Canada
    Posts
    3
    When using Big O notation, constants are eliminated, and as N get high N^2 becomes much more signifigant than just N...

    For my prof all I would have to write is:

    f(n) = 4n2 + 6n + 1
    O(kn^2 + bn)
    because as n becomes larger bn becomes more insignifigant
    O(n^2)
    Mind over metal
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules


Click Here to Expand Forum to Full Width