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
Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

Quick question

  • 12-05-2009 3:59pm
    #1
    Registered Users, Registered Users 2 Posts: 929 ✭✭✭


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


Comments

  • Closed Accounts Posts: 12,382 ✭✭✭✭AARRRGH


    You'll need to provide a lot more information.


  • Registered Users, Registered Users 2 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


  • Registered Users, Registered Users 2 Posts: 7,182 ✭✭✭Genghiz Cohen


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


  • Registered Users, Registered Users 2 Posts: 981 ✭✭✭fasty


    A for loop.


  • Registered Users, Registered Users 2 Posts: 929 ✭✭✭sternn


    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