Results 1 to 1 of 1

Math Help - Algorithm analysis

  1. #1
    Member
    Joined
    Oct 2008
    From
    Singapore
    Posts
    160

    Solved : Algorithm analysis

    For each of the following pairs of functions f(n) and g(n), state whether f is bigoh(g); whether f is teta(g); and whether f is
    omega(g). (More than one of there can be true for a single pair.) Justify your answers

    a. f(n) = n^10; g(n) = 2^(n/2)
    b. f(n) = n^(3/2); g(n) = nlg^2(n)
    c. f(n) = lg(n^3); g(n) = lg(n)
    d. f(n) = lg(3^n); g(n) = lg(2^n)
    e. f(n) = 2^n; g(n) = 2^(n/2)

    I think my approach to the problem is very time consuming where i will use L'hopital's rule to solve the problem. I am pretty scared that i will take too much time doing such a tedious process in exam. Does anyone
    has a better way of doing the questions listed above other than using a graph software or calculator. Please enlighten me.
    Thanks in advance.
    Last edited by tester85; January 23rd 2009 at 08:49 PM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Algorithm Analysis
    Posted in the Math Topics Forum
    Replies: 3
    Last Post: July 1st 2009, 05:02 AM
  2. (Another) Algorithm Analysis
    Posted in the Math Topics Forum
    Replies: 1
    Last Post: June 9th 2009, 02:30 AM
  3. Algorithm analysis
    Posted in the Math Topics Forum
    Replies: 5
    Last Post: June 4th 2009, 05:29 AM
  4. Algorithm Analysis - Big-oh, etc...
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: February 8th 2009, 09:18 AM
  5. help me to prove this algorithm analysis
    Posted in the Discrete Math Forum
    Replies: 11
    Last Post: February 12th 2008, 08:13 PM

Search Tags


/mathhelpforum @mathhelpforum