Results 1 to 2 of 2

Math Help - Computational Complexity

  1. #1
    Junior Member
    Joined
    Mar 2013
    From
    u.s.
    Posts
    50

    Computational Complexity

    How do you determine the best "big-Oh" form?

    Use the results of Table 1 to determine the best “big-Oh” form for the following function f: Z^+→ R.
    f(n) = 3n + 7

    Table 1 (I'm not sure how to write tables so I used the dash (-----):


    Big-Oh Form ------------------------ Name
    O(1) --------------------------------- Constant
    O(log_2 n) -------------------------- Logarithmic
    O(n) --------------------------------- Linear
    O(n log_2 n) ------------------------ n log_2 n
    O(n^2) ------------------------------ Quadratic
    O(n^3) ------------------------------ Cubic
    O(n^m), m = 0, 1, 2, 3,... ------- Polynomial
    O(c^n), c > 1 ----------------------- Exponential
    O(n!) -------------------------------- Factorial
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,517
    Thanks
    771

    Re: Computational Complexity

    May I ask how many solved examples of similar problems you have read and understood?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] complexity theorie, deterministic turing-machines, time complexity
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: December 19th 2011, 06:44 AM
  2. Computational Complexity.
    Posted in the Advanced Applied Math Forum
    Replies: 2
    Last Post: May 24th 2010, 06:23 PM
  3. Computational Complexity
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: May 13th 2010, 07:48 PM
  4. Computational Algebra Programs
    Posted in the Math Software Forum
    Replies: 0
    Last Post: October 11th 2009, 11:49 AM
  5. Computational Geo
    Posted in the Differential Geometry Forum
    Replies: 0
    Last Post: February 24th 2009, 07:47 AM

Search Tags


/mathhelpforum @mathhelpforum