Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Quick question

Options
  • 12-05-2009 4:59pm
    #1
    sternn
    Registered Users Posts: 929 ✭✭✭


    What would be the best way to define f(n) is O(n)?


Comments

  • Options
    #2
    AARRRGH
    Closed Accounts Posts: 12,382 ✭✭✭✭AARRRGH


    You'll need to provide a lot more information.


  • Options
    #3
    sternn
    Registered Users Posts: 929 ✭✭✭sternn


    A question in a sample paper of mine asks: Given a formal definition of the statement f(n) is O(n).... Its to do with C++ kind of


  • Options
    #4
    Genghiz Cohen
    Registered Users Posts: 7,182 ✭✭✭Genghiz Cohen


    Is that Big-O notation? The time a function/algo takes to execute?


  • Options
    #5
    fasty
    Registered Users Posts: 981 ✭✭✭fasty


    A for loop.


  • Options
    #6
    sternn
    Registered Users Posts: 929 ✭✭✭sternn


    Genghiz Cohen wrote: »
    Is that Big-O notation? The time a function/algo takes to execute?

    As far as I know, yes...something to do with big O notation


  • Advertisement
Advertisement