O notation - log functions run time comparison
From: airnikez (ericworldz_at_msn.com)
Date: 07/01/04
- Previous message: pp: "minimal DFA accepting numbers divisible by N over {0,1} alphabet"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 1 Jul 2004 11:28:41 -0700
how do I compare the following functions to know the bound - big O,
small o, omega, micron, and theta:
n^(1/3) (logn)^6
n^2(2^n) 3^n
thanks/
- Previous message: pp: "minimal DFA accepting numbers divisible by N over {0,1} alphabet"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|