log function comparison

From: airnikez (ericworldz_at_msn.com)
Date: 07/01/04 

Date: Thu, 1 Jul 2004 18:56:33 +0000 (UTC)

how do I compare these functions below and figure out which one is faster than the other.. i'm using O notation..

n^2(2^n) 3^n

n^(1/3) (logn)^6

I need to know the relationship between the 2 functions. Is it big O, small o, omega, theta, micron?

Thanks.

Relevant Pages

  • O notation - log functions run time comparison
    ... how do I compare the following functions to know the bound - big O, ... small o, omega, micron, and theta: ...
    (comp.theory)
  • Re: Big oh Notation
    ... Big O notation is the "Worst ... "average" case and is the best to compare two algorithms. ... Or any good Discreet Math book will have it. ...
    (comp.lang.java)
  • Re: Doubts about relativity dogmas
    ... newtonian gravity outside the range of its empirical validity. ... If theta is pi/2 substitution of sinby theta is wrong but theta ... It is an abuse of notation whose purpose is only to cover your ass. ...
    (sci.physics.relativity)
  • Re: Using Java Classes to Sort a Small Array Quickly
    ... "Informally, especially in computer science, the Big O notation often is ... Big O is the upper bound. ... Big Theta is the average case ... Omega is lower bound. ...
    (comp.lang.java.programmer)
  • Re: ROUSs? I dont think they exist.
    ... as another matrix algorithm, regardless of the size of the input, what ... notation do you use to compare the two? ...
    (alt.sysadmin.recovery)