complexity analysis estimates | topic started 11/22/2005; 3:57:32 AM last post 11/22/2005; 3:57:32 AM |
bullet green - complexity analysis estimates 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. |