UsingWW: bullet green - complexity analysis estimates

Forum archive 2000-2006

bullet green - complexity analysis estimates

$inactiveTopic$ complexity analysis estimates

topic started 11/22/2005; 3:57:32 AM
last post 11/22/2005; 3:57:32 AM

$user$ bullet green - complexity analysis estimates $blueArrow$
11/22/2005; 3:57:32 AM (reads: 217, responses: 0)

Hi everybody, will you help me find two finctions f(n) and g(n) such that neither f(n) = Big-oh(g(n)) nor g(n) = Big-oh(f(n)).

thanks.

<| Post or View Comments |>